The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
순환 해밍 코드의 서브코드의 거의 최적성은 잡음 프로세스가 버스트 통신 채널의 모델인 2상태 동종 마르코프 체인인 이진 덧셈 채널에서 입증됩니다.
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.
부
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
부
@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},}
부
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 -