Generalized error-locating codes with component codes over the same alphabet
- 1 April 2017
- journal article
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 53 (2) , 114-135
Abstract
We consider generalized error locating (GEL) codes over the same alphabet for both component codes. We propose an algorithm for computing an upper bound on the decoding error probability under known input symbol error rate and code parameters. Is is used to construct an algorithm for selecting code parameters to maximize the code rate for a given construction and given input and output error probabilities. A lower bound on the decoding error probability is given. Examples of plots of decoding error probability versus input symbol error rate are given, and their behavior is explained.Keywords
This publication has 8 references indexed in Scilit:
- Investigation of signal-code structures based on 3D error-locating codesJournal of Communications Technology and Electronics, 2013
- Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC CodesIEEE Communications Letters, 2004
- Low-Complexity GEL Codes for Digital Magnetic Storage SystemsIEEE Transactions on Magnetics, 2004
- On the equivalence of generalized concatenated codes and generalized error location codesIEEE Transactions on Information Theory, 2000
- Multilevel codes: theoretical concepts and practical design rulesIEEE Transactions on Information Theory, 1999
- On codes derivable from the tensor product of check matricesIEEE Transactions on Information Theory, 1965
- On an extended class of error-locating codesInformation and Control, 1965
- Error-locating codes--A new concept in error controlIEEE Transactions on Information Theory, 1963