A new error-locating polynomial for decoding of BCH codes (Corresp.)
From MaRDI portal
Publication:4048919
DOI10.1109/TIT.1975.1055344zbMATH Open0295.94015OpenAlexW2121081893MaRDI QIDQ4048919FDOQ4048919
Authors: George Davida, James W. Cowles 
Publication date: 1975
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1975.1055344
Cited In (4)
- An improved algorithm for Davida amd Cowles's decoding method
- Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial
- Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
This page was built for publication: A new error-locating polynomial for decoding of BCH codes (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4048919)
