Systematic construction of self-orthogonal diffuse codes
- 1 September 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 16 (5) , 594-604
- https://doi.org/10.1109/tit.1970.1054520
Abstract
A systematic procedure for constructing binary self-orthogonal diffuse codes is presented. These codes correct both random and burst errors. A lower bound on actual constraint length for this class of codes is found. The given construction procedure generally yields codes that approach the lower bound for large burst error correction and are, therefore, asymptotically optimal.Keywords
This publication has 10 references indexed in Scilit:
- Burst-trapping techniques for a compound channelIEEE Transactions on Information Theory, 1969
- Convolutional Reed-Solomon CodesBell System Technical Journal, 1969
- Convolutional coding for channels with memoryIEEE Transactions on Information Theory, 1968
- Error-correcting codes for a compound channelIEEE Transactions on Information Theory, 1968
- A class of binary recurrent codes with limited error propagationIEEE Transactions on Information Theory, 1967
- Simultaneous Error-Correction and Burst-Error Detection Using Binary Linear Cyclic CodesJournal of the Society for Industrial and Applied Mathematics, 1965
- Cyclic product codesIEEE Transactions on Information Theory, 1965
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963
- Multiple burst error correctionInformation and Control, 1961
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960