| Publication | Date of Publication | Type |
|---|
A note on t-EC/d-UED codes
IEEE Transactions on Computers | 2018-09-14 | Paper |
Efficient heuristic search algorithms for soft-decision decoding of linear block codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Efficient heuristic search algorithms for soft-decision decoding of linear block codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
IEEE Transactions on Information Theory | 1998-10-18 | Paper |
The zero-guards algorithm for general minimum-distance decoding problems
IEEE Transactions on Information Theory | 1998-05-03 | Paper |
Parallel integer sorting using small operations
Acta Informatica | 1995-03-22 | Paper |
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors
Information Processing Letters | 1993-05-23 | Paper |
PRAMs with variable word-size
Information Processing Letters | 1993-01-16 | Paper |
An efficient class of unidirectional error detecting/correcting codes
IEEE Transactions on Computers | 1988-01-01 | Paper |
Iteratively maximum likelihood decodable spherical codes and a method for their construction
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Network Reliability Evaluation Using Probability Expressions
IEEE Transactions on Reliability | 1986-01-01 | Paper |
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Generalization of chase algorithms for soft decision decoding of binary linear codes
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Decoding by local optimization (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Application of information theory to the construction of efficient decision trees
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
Application of Information Theory to Sequential Fault Diagnosis
IEEE Transactions on Computers | 1982-01-01 | Paper |
Dual-Mode Logic for Function-Independent Fault Testing
IEEE Transactions on Computers | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3666675 (Why is no real title available?) | 1979-01-01 | Paper |
Algebraic analog decoding of linear binary codes
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
Some results on arithmetic codes of composite length
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
An Algorithm for Testing Random Access Memories
IEEE Transactions on Computers | 1977-01-01 | Paper |
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.)
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
Some results on the weight structure of cyclic codes of composite length
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
An optimum symbol-by-symbol decoding rule for linear codes
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
Weight distributions of some classes of binary cyclic codes (Corresp.)
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
On the structure of generalized finite-geometry codes
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Majority decoding of some classes of binary cyclic codes
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Decoding by sequential code reduction
IEEE Transactions on Information Theory | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3437025 (Why is no real title available?) | 1973-01-01 | Paper |
On some classes of cyclic codes of composite length (Corresp.)
IEEE Transactions on Information Theory | 1973-01-01 | Paper |
A bound for cyclic codes of composite length (Corresp.)
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
A note on the minimum distance structure of cyclic codes (Corresp.)
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
Decoding beyond the BCH bound (Corresp.)
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
Generalizations of the BCH bound
Information and Control | 1972-01-01 | Paper |
Some results on the minimum distance structure of cyclic codes
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
On the minimum distance of certain reversible cyclic codes (Corresp.)
IEEE Transactions on Information Theory | 1970-01-01 | Paper |
