Decoding by sequential code reduction
- 1 July 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (4) , 549-555
- https://doi.org/10.1109/tit.1973.1055023
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Number of information symbols in polynomial codesIEEE Transactions on Information Theory, 1972
- Note on majority-logic decoding of finite geometry codes (Corresp.)IEEE Transactions on Information Theory, 1972
- New generalizations of the Reed-Muller codes--II: Nonprimitive codesIEEE Transactions on Information Theory, 1968
- New generalizations of the Reed-Muller codes--I: Primitive codesIEEE Transactions on Information Theory, 1968
- On a class of majority-logic decodable cyclic codesIEEE Transactions on Information Theory, 1968
- A class of majority logic decodable codes (Corresp.)IEEE Transactions on Information Theory, 1967
- Difference-Set Cyclic CodesBell System Technical Journal, 1966
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954