| Publication | Date of Publication | Type |
|---|
Coding and bounds for partially defective memory cells
Designs, Codes and Cryptography | 2023-11-20 | Paper |
Round5: compact and fast post-quantum public-key encryption
| 2020-02-25 | Paper |
A Multi-layer Recursive Residue Number System
| 2018-01-15 | Paper |
Candle in the woods: asymptotic bounds on minimum blocking sets
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
The MMO problem
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Interpolation and approximation of polynomials in finite fields over a short interval from noisy values
Experimental Mathematics | 2015-04-30 | Paper |
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Common coordinates in consecutive addresses
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Quaternary Unequal Error Protection Codes
Coding Theory and Applications | 2008-11-25 | Paper |
Entropy of a bit-shift channel
| 2007-09-19 | Paper |
Generic erasure correcting sets: bounds and constructions
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
XOR-based visual cryptography schemes
Designs, Codes and Cryptography | 2005-11-07 | Paper |
More results on the weight enumerator of product codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
New codes via the lengthening of BCH codes with UEP codes
Finite Fields and their Applications | 2003-09-04 | Paper |
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
IEEE Transactions on Information Theory | 2003-02-11 | Paper |
Comment on ``error rate performance of the projection code
IEEE Transactions on Communications | 2001-08-14 | Paper |
On perfect ternary constant weight codes
Designs, Codes and Cryptography | 2001-01-01 | Paper |
Efficient encoding for a class of subspace subcodes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
On codes with the identifiable parent property
Journal of Combinatorial Theory. Series A | 1999-04-12 | Paper |
On Diamond codes
IEEE Transactions on Information Theory | 1998-11-04 | Paper |
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
IEEE Transactions on Information Theory | 1998-04-02 | Paper |
scientific article; zbMATH DE number 897548 (Why is no real title available?)
| 1996-07-07 | Paper |
Constructions and properties of block codes for partial-response channels
IEEE Transactions on Information Theory | 1996-06-04 | Paper |
scientific article; zbMATH DE number 493102 (Why is no real title available?)
| 1994-01-27 | Paper |
A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
Designs, Codes and Cryptography | 1993-07-21 | Paper |
On the weight enumerator of product codes
Discrete Mathematics | 1993-01-16 | Paper |
Two new binary codes obtained by shortening a generalized concatenated code
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
On the minimum distance of combinatorial codes
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
New binary linear block codes (Corresp.)
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
