Algebraic constructions of Shannon codes for regular channels
- 1 July 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (4) , 593-599
- https://doi.org/10.1109/tit.1982.1056525
Abstract
The problem of the explicit construction of encoders achieving Shannon's capacity and admitting a simple decoding algorithm is considered. A solution based on Justesen's idea of variable concatenated codes is given for the case of a symmetric memoryless channel with an input alphabet of prime power order, under the assumption that the information messages are equiprobable. This construction remains good for a nonsymmetric channel provided the encoding rate is smaller than a well-defined "pseudocapacity." In case the channel is regular, it is shown that the error probability after decoding is an exponentially decreasing function of the block length for any encoding rate less than the channel capacity.Keywords
This publication has 8 references indexed in Scilit:
- Certain generalizations of concatenated codes--Exponential error bounds and decoding complexityIEEE Transactions on Information Theory, 1980
- Linear ensembles of codes (Corresp.)IEEE Transactions on Information Theory, 1979
- On the complexity of decoding Goppa codes (Corresp.)IEEE Transactions on Information Theory, 1977
- The Noisy Channel Coding Theorem for Erasure ChannelsThe American Mathematical Monthly, 1974
- Justesen's construction--The low-rate case (Corresp.)IEEE Transactions on Information Theory, 1973
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948