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
É dada uma condição suficiente para que um código seja ótimo em canais discretos com alfabetos de entrada e saída finitos, onde ser ótimo significa atingir a probabilidade mínima de erro de decodificação. Esta condição é derivada da generalização das ideias de códigos binários perfeitos e quase perfeitos, que são conhecidos por serem ótimos no canal binário simétrico. Uma aplicação da condição suficiente mostra que o código apresentado por Hamada e Fujiwara (1997) é ótimo no qmodelo de canal -ary proposto por Fuja e Heegard (1990), onde q é uma potência principal com algumas restrições. O modelo de canal está sujeito a dois tipos de erros aditivos de probabilidades (em geral) diferentes.
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.
Copiar
Mitsuru HAMADA, "A Sufficient Condition for a Code to Achieve the Minimum Decoding Error Probability--Generalization of Perfect and Quasi-Perfect Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 1870-1877, October 2000, doi: .
Abstract: A sufficient condition for a code to be optimum on discrete channels with finite input and output alphabets is given, where being optimum means achieving the minimum decoding error probability. This condition is derived by generalizing the ideas of binary perfect and quasi-perfect codes, which are known to be optimum on the binary symmetric channel. An application of the sufficient condition shows that the code presented by Hamada and Fujiwara (1997) is optimum on the q-ary channel model proposed by Fuja and Heegard (1990), where q is a prime power with some restriction. The channel model is subject to two types of additive errors of (in general) different probabilities.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_1870/_p
Copiar
@ARTICLE{e83-a_10_1870,
author={Mitsuru HAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Sufficient Condition for a Code to Achieve the Minimum Decoding Error Probability--Generalization of Perfect and Quasi-Perfect Codes},
year={2000},
volume={E83-A},
number={10},
pages={1870-1877},
abstract={A sufficient condition for a code to be optimum on discrete channels with finite input and output alphabets is given, where being optimum means achieving the minimum decoding error probability. This condition is derived by generalizing the ideas of binary perfect and quasi-perfect codes, which are known to be optimum on the binary symmetric channel. An application of the sufficient condition shows that the code presented by Hamada and Fujiwara (1997) is optimum on the q-ary channel model proposed by Fuja and Heegard (1990), where q is a prime power with some restriction. The channel model is subject to two types of additive errors of (in general) different probabilities.},
keywords={},
doi={},
ISSN={},
month={October},}
Copiar
TY - JOUR
TI - A Sufficient Condition for a Code to Achieve the Minimum Decoding Error Probability--Generalization of Perfect and Quasi-Perfect Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1870
EP - 1877
AU - Mitsuru HAMADA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - A sufficient condition for a code to be optimum on discrete channels with finite input and output alphabets is given, where being optimum means achieving the minimum decoding error probability. This condition is derived by generalizing the ideas of binary perfect and quasi-perfect codes, which are known to be optimum on the binary symmetric channel. An application of the sufficient condition shows that the code presented by Hamada and Fujiwara (1997) is optimum on the q-ary channel model proposed by Fuja and Heegard (1990), where q is a prime power with some restriction. The channel model is subject to two types of additive errors of (in general) different probabilities.
ER -