| Publication | Date of Publication | Type |
|---|
Cyclic partial geometries and their associated LDPC and constant-weight codes
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Efficient detection of discrepancies in multiple file copies
Distributed Computing | 2020-12-02 | Paper |
A Scheme for Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths: Applications to Reed–Solomon, BCH, and Quadratic Residue Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Sets of binary sequences with small total Hamming distances
Information Processing Letters | 2018-12-05 | Paper |
Efficient detection of corrupted pages in a replicated file
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Moment Balancing Templates: Constructions to Add Insertion/Deletion Correction Capability to Error Correcting or Constrained Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Burst Decoding of Cyclic Codes Based on Circulant Parity-Check Matrices
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Correcting Deletions Using Linear and Cyclic Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Error-Correcting Codes for Flash Coding
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Insertion/Deletion Detecting Codes and the Boundary Problem
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Parity-Check Matrices Separating Erasures From Errors
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
BCH Codes for the Rosenbloom–Tsfasman Metric
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Maximum True Burst-Correcting Capability of Fire Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| LDPC code designs, constructions, and unification | 2016-12-05 | Paper |
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
Problems of Information Transmission | 2013-04-03 | Paper |
Counting matrices over finite fields having a given number of rows of unit weight
Linear Algebra and its Applications | 2012-04-19 | Paper |
Maximum number of edges joining vertices on a cube
Information Processing Letters | 2009-04-28 | Paper |
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Codes on finite geometries
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Simple Derivation of the Undetected Error Probabilties of Complementary Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Reduced GMD decoding
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Repeated use of codes for error detection five times is bad
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 1982620 (Why is no real title available?) | 2003-09-16 | Paper |
Constructing efficient DC-free runlength-limited block codes for recording channels
IEEE Transactions on Information Theory | 2002-10-30 | Paper |
The determinant of random power series matrices over finite fields
Linear Algebra and its Applications | 2001-07-19 | Paper |
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Long division for Laurent series matrices and the optimal assignment problem
Linear Algebra and its Applications | 1999-11-25 | Paper |
Difference set codes: codes with squared Euclidean distance of six for partial response channels
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Detecting Substitutions and Transpositions of Characters
The Computer Journal | 1999-06-13 | Paper |
Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes
IEEE Transactions on Information Theory | 1998-08-10 | Paper |
A lower bound on the undetected error probability and strictly optimal codes
IEEE Transactions on Information Theory | 1998-05-29 | Paper |
Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation
IEEE Transactions on Information Theory | 1997-11-11 | Paper |
| scientific article; zbMATH DE number 894713 (Why is no real title available?) | 1997-04-07 | Paper |
Analysis of coding schemes for modulation and error control
IEEE Transactions on Information Theory | 1996-06-04 | Paper |
Cascading runlength-limited sequences
IEEE Transactions on Information Theory | 1995-03-15 | Paper |
A universal neural net with guaranteed convergence to zero system error
IEEE Transactions on Signal Processing | 1993-05-16 | Paper |
On unit constraint-length convolutional codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4207992 (Why is no real title available?) | 1991-01-01 | Paper |
The number of convolutional codes of span one
Computers & Mathematics with Applications | 1991-01-01 | Paper |
Finite-state codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Some convolutional codes whose free distances are maximal
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Two-dimensional burst identification codes and their use in burst correction
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
On the existence of optimum cyclic burst correcting codes over GF(q)
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
On the existence of optimum cyclic burst- correcting codes
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
