IEICE TRANSACTIONS on Fundamentals
Channel Coding Algorithm Simulating the Random Coding
Summary :
Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.6 pp.1576-1582
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ken-ichi IWATA, Jun MURAMATSU, "Channel Coding Algorithm Simulating the Random Coding" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 6, pp. 1576-1582, June 2004, doi: .
Abstract: Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_6_1576/_p
Copy
@ARTICLE{e87-a_6_1576,
author={Ken-ichi IWATA, Jun MURAMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Channel Coding Algorithm Simulating the Random Coding},
year={2004},
volume={E87-A},
number={6},
pages={1576-1582},
abstract={Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Channel Coding Algorithm Simulating the Random Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1576
EP - 1582
AU - Ken-ichi IWATA
AU - Jun MURAMATSU
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2004
AB - Recently, Muramatsu proposed source coding algorithms that use the randomness of a past sequence. The technique of his source coding algorithms is one method of constructing codes from the technique of random coding. By using his technique, we propose a channel coding algorithm with random numbers which can be observed by both the encoder and the decoder where the random numbers are independent of the messages to be transmitted. Then the proposed coding algorithm can transmit messages over a discrete memoryless channel up to the channel capacity with an arbitrarily small decoding error rate and arbitrarily small bits of random numbers per message transmission asymptotically.
ER -
English
