On decoding binary perfect and quasi-perfect codes over markov noise channels

Autor:	Fady Alajaji, Haider Al-Lawati
Rok vydání:	2009
Předmět:	Discrete mathematics Hamming bound Concatenated error correction code List decoding Data_CODINGANDINFORMATIONTHEORY Sequential decoding Linear code Binary symmetric channel Electrical and Electronic Engineering Hamming code Algorithm Decoding methods Computer Science::Information Theory Mathematics
Zdroj:	IEEE Transactions on Communications. 57:873-878
ISSN:	1558-0857 0090-6778
DOI:	10.1109/tcomm.2009.04.070114
Popis:	We study the decoding problem when a binary linear perfect or quasi-perfect code is transmitted over a binary channel with additive Markov noise. After examining the properties of the channel block transition distribution, we derive sufficient conditions under which strict maximum-likelihood decoding is equivalent to strict minimum Hamming distance decoding when the code is perfect. Additionally, we show a near equivalence relationship between strict maximum likelihood and strict minimum distance decoding for quasi-perfect codes for a range of channel parameters and the code's minimum distance. As a result, an improved (complete) minimum distance decoder is proposed and simulations illustrating its benefits are provided.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e3dd526b9b7539cc82bc6fec3e8ba380 https://doi.org/10.1109/tcomm.2009.04.070114 Zobrazit plný text záznamu