THE ZERO-GUARDS ALGORITHM FOR GENERAL MINIMUM-DISTANCE DECODING PROBLEMS

Authors
HAN YSS HARTMANN CRP
Citation
Yss. Han et Crp. Hartmann, THE ZERO-GUARDS ALGORITHM FOR GENERAL MINIMUM-DISTANCE DECODING PROBLEMS, IEEE transactions on information theory, 43(5), 1997, pp. 1655-1658
Citations number
5
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
43
Issue
5
Year of publication
1997
Pages
1655 - 1658
Database
ISI
SICI code
0018-9448(1997)43:5<1655:TZAFGM>2.0.ZU;2-#
Abstract
In this correspondence we present some properties of an improved versi on of the Zero-Neighbors algorithm-the Zero-Guards algorithm. These pr operties can be used to find a Zero-Guards. A new decoding procedure u sing a Zero-Guards is also given.