On the problem of finding zero-concurring codewords

DOI10.1109/18.61136MaRDI QIDQ3199335zbMATH OpenOpenAlexFDO

Authors Alexander Vardy, Yair Be'ery

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.61136

zbMATH Keywords

binary BCH codesdc-free codessoft-decision decodingZero-concurring codewords

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• On a problem from encoding theory
• On Optimal and Achievable Fix-Free Codes
• On a conjecture about commuting codes
• On the complete decoding of constrained codes
• On zero-error codes produced by greedy algorithms
• scientific article; zbMATH DE number 3865152
• On Codes Achieving Zero Error Capacities in Limited Magnitude Error Channels
• The zero-guards algorithm for general minimum-distance decoding problems
• On optimal constacyclic codes
• On a class of convolutional codes

This page was built for publication: On the problem of finding zero-concurring codewords

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199335)