| Publication | Date of Publication | Type |
|---|
Variable- and Fixed-Length Balanced Runlength-Limited Codes Based on a Knuth-Like Balancing Method
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Mathematical approach and implementation of frequency mapping techniques in power-line communications channel
Communications in Applied and Industrial Mathematics | 2019-10-01 | Paper |
New distance concept and graph theory approach for certain coding techniques design and analysis
Communications in Applied and Industrial Mathematics | 2019-10-01 | 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 |
Correcting Deletions Using Linear and Cyclic Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Systematic Generator Matrices for Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Constructing Coset Codes With Optimal Same-Symbol Weight for Detecting Narrowband Interference in $M$-FSK Systems
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Moment Balancing Templates for Spectral Null Codes
IEEE Transactions on Information Theory | 2017-07-27 | 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 Balanced Knuth 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 |
Moment Balancing Templates for $(d,k)$-Constrained Codes and Run-Length Limited Sequences
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Insertion/Deletion Detecting Codes and the Boundary Problem
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency
Cryptography and Communications | 2012-02-21 | Paper |
Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A note on double insertion/deletion correcting codes
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
On multiple insertion/deletion correcting codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes
IEEE Transactions on Information Theory | 1998-08-10 | Paper |
On the complete decoding of constrained codes
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
