IEICE TRANSACTIONS on Fundamentals
Near-Optimality of Subcodes of Hamming Codes on the Two-State Markovian Additive Channel
Summary :
Near-optimality of subcodes of the cyclic Hamming codes is demonstrated on the binary additive channel whose noise process is the two-state homogeneous Markov chain, which is a model of bursty communication channels.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.10 pp.2383-2388
- Publication Date
- 2001/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding 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
Mitsuru HAMADA, "Near-Optimality of Subcodes of Hamming Codes on the Two-State Markovian Additive Channel" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2383-2388, October 2001, doi: .
Abstract: Near-optimality of subcodes of the cyclic Hamming codes is demonstrated on the binary additive channel whose noise process is the two-state homogeneous Markov chain, which is a model of bursty communication channels.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2383/_p
Copy
@ARTICLE{e84-a_10_2383,
author={Mitsuru HAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Near-Optimality of Subcodes of Hamming Codes on the Two-State Markovian Additive Channel},
year={2001},
volume={E84-A},
number={10},
pages={2383-2388},
abstract={Near-optimality of subcodes of the cyclic Hamming codes is demonstrated on the binary additive channel whose noise process is the two-state homogeneous Markov chain, which is a model of bursty communication channels.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Near-Optimality of Subcodes of Hamming Codes on the Two-State Markovian Additive Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2383
EP - 2388
AU - Mitsuru HAMADA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2001
AB - Near-optimality of subcodes of the cyclic Hamming codes is demonstrated on the binary additive channel whose noise process is the two-state homogeneous Markov chain, which is a model of bursty communication channels.
ER -
English
