Channel Code Using Constrained-Random-Number Generator Revisited

被引：7

作者：

Muramatsu, Jun ^{[1
]}

Miyake, Shigeki ^{[2
]}

机构：

[1] NTT Corp, NTT Commun Sci Labs, Kyoto 6190237, Japan

[2] NTT Corp, NTT Network Innovat Labs, Atsugi, Kanagawa 2390847, Japan

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2019年 / 65卷 / 01期

关键词：

Shannon theory; channel coding; source code with decoder side information; constrained-random-number generator; COMPRESSION; WOLF; CAPACITY; THEOREMS; MATRICES; PROOF;

D O I：

10.1109/TIT.2018.2878217

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A construction of a channel code by using a source code with decoder side information is introduced. The encoder and decoder pair of any source code can be used for the construction. Constrained-random-number generators, which generate random numbers satisfying a condition specified by a function and its value, are used to construct stochastic encoders and decoders. The result suggests that we can divide the channel coding problem into the problems of channel encoding and source decoding with side information.

引用

页码：500 / 510

页数：11

共 46 条

[1] Common randomness in information theory and cryptography - Part II: CR capacity [J].

Ahlswede, R ;

Csiszar, I .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :225-240

[2]

[Anonymous], 1955, IRE Conv. Rec.

[3] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].

Arikan, Erdal .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073

[4]

Bajcsy J, 2001, GLOB TELECOMM CONF, P1400, DOI 10.1109/GLOCOM.2001.965721

[5] On the application of LDPC codes to arbitrary discrete-memoryless channels [J].

Bennatan, A ;

Burshtein, D .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (03) :417-438

[6]

BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441

[7]

Blahut R. E., 1987, Principles and Practice of Information Theory

[8]

CARTER JL, 1979, J COMPUT SYST SCI, V18, P143, DOI 10.1016/0022-0000(79)90044-8

[9] On the Linear Codebook-Level Duality Between Slepian-Wolf Coding and Channel Coding [J].

Chen, Jun ;

He, Da-ke ;

Jagmohan, Ashish ;

Lastras-Montano, Luis A. ;

Yang, En-hui .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) :5575-5590

[10] NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].

COVER, TM ;

HART, PE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+

← 1 2 3 4 5 →