| Publication | Date of Publication | Type |
|---|
Codes of length two correcting single errors of limited size
Cryptography and Communications | 2019-05-15 | Paper |
| Codes of length two correcting single errors of limited size. II | 2019-02-15 | Paper |
Generalizations of the Griesmer bound
Lecture Notes in Computer Science | 2018-04-26 | Paper |
Some Optimal Binary and Ternary $t$-EC-AUED Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Constructing Proper Codes for Error Detection
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Some Necessary Conditions for Codes to Be Good for Error Detection
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Permutation Arrays Under the Chebyshev Distance
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Codes Correcting Single Errors of Limited Magnitude
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Some Codes Correcting Asymmetric Errors of Limited Magnitude
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Two Constructions of Covering Sets for Limited-Magnitude Errors
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On covering sets for limited-magnitude errors
Cryptography and Communications | 2016-05-04 | Paper |
Codes of length 2 correcting single errors of limited size
Cryptography and Coding | 2016-01-12 | Paper |
Linear covering codes and error-correcting codes for limited-magnitude errors
Designs, Codes and Cryptography | 2014-08-18 | Paper |
Lower bounds on the size of spheres of permutations under the Chebychev distance
Designs, Codes and Cryptography | 2011-04-08 | Paper |
Generating functions for the number of permutations with limited displacement
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Generating functions for the number of permutations with limited displacement
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Distance-Preserving Mappings
Coding and Cryptology | 2009-03-09 | Paper |
Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Binary Linear Codes That Are Optimal for Error Correction
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Diversity Combining for the Z-Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Generalized Bose–Lin Codes, a Class of Codes Detecting Asymmetric Errors
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Two Constructions of Permutation Arrays
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Generic Construction of Cartesian Authentication Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Error-Correction Capability of Binary Linear Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Codes for error detection. | 2007-06-06 | Paper |
Weight hierarchies of linear codes satisfying the almost chain condition
Science in China. Series F | 2007-02-20 | Paper |
On the second greedy weight for linear codes satisfying the fullrank condition
Journal of Systems Science and Complexity | 2006-01-13 | Paper |
Distance-preserving mappings from binary vectors to permutations
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
On the undetected error probability for binary codes
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
Constructions of permutation arrays
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Finite projective geometries and classification of the weight hierarchies of codes. I
Acta Mathematica Sinica, English Series | 2004-11-25 | Paper |
Weight hierarchies of linear codes of dimension 3
Journal of Statistical Planning and Inference | 2003-09-08 | Paper |
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
Designs, Codes and Cryptography | 2003-09-07 | Paper |
Two classes of ternary codes and their weight distributions
Discrete Applied Mathematics | 2003-08-26 | Paper |
Hypercubic 4 and 5-designs from double-error-correcting BCH codes
Designs, Codes and Cryptography | 2003-07-01 | Paper |
On equidistant constant weight codes
Discrete Applied Mathematics | 2003-06-10 | Paper |
On the second greedy weight for linear codes of dimension 3
Discrete Mathematics | 2002-10-08 | Paper |
On the Svanstrom bound for ternary constant-weight codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Relations between the covering and Newton radii of binary codes
Discrete Mathematics | 2002-03-06 | Paper |
Diffuse difference triangle sets
Journal of Statistical Planning and Inference | 2002-02-21 | Paper |
| On equidistant constant weight codes | 2001-10-14 | Paper |
Weight hierarchies of binary linear codes of dimension 4
Discrete Mathematics | 2001-09-19 | Paper |
| scientific article; zbMATH DE number 1504658 (Why is no real title available?) | 2000-09-12 | Paper |
On the Newton and covering radii of linear codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
The undetected error probability threshold of m-out-of-n codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1461533 (Why is no real title available?) | 2000-06-20 | Paper |
On the Hamming distance between two i.i.d. random n-tuples over a finite set
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Weight hierarchies of extremal non-chain binary codes of dimension 4
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
How to build robust shared control systems
Designs, Codes and Cryptography | 1999-08-26 | Paper |
Weight hierarchies of linear codes satisfying the chain condition
Designs, Codes and Cryptography | 1999-05-31 | Paper |
New construction of disjoint distinct difference sets
Designs, Codes and Cryptography | 1999-05-09 | Paper |
| scientific article; zbMATH DE number 1189048 (Why is no real title available?) | 1999-03-22 | Paper |
The Newton radius of codes
IEEE Transactions on Information Theory | 1999-01-14 | Paper |
Bounds on the weight hierarchies of linear codes of dimension 4
IEEE Transactions on Information Theory | 1998-11-17 | Paper |
Disjoint sets of distinct sum sets
Discrete Mathematics | 1998-03-08 | Paper |
On codes satisfying the double chain condition
Discrete Mathematics | 1998-01-26 | Paper |
Bounds on the weight hierarchies of extremal non-chain codes of dimension 4
Applicable Algebra in Engineering, Communication and Computing | 1997-12-04 | Paper |
Almost-MDS and near-MDS codes for error detection
IEEE Transactions on Information Theory | 1997-11-16 | Paper |
Bounds on the weight distribution of cosets
IEEE Transactions on Information Theory | 1997-10-09 | Paper |
On generalization of sonar sequences and intermodulation-free frequencies assignment sequences
Acta Mathematicae Applicatae Sinica. English Series | 1997-07-13 | Paper |
On the information function of an error-correcting code
IEEE Transactions on Information Theory | 1997-06-10 | Paper |
The weight hierarchies of q-ary codes of dimension 4
IEEE Transactions on Information Theory | 1997-05-12 | Paper |
| scientific article; zbMATH DE number 1001631 (Why is no real title available?) | 1997-04-20 | Paper |
The weight hierarchies of some product codes
IEEE Transactions on Information Theory | 1997-04-09 | Paper |
The worst case probability of undetected error for linear codes on the local binomial channel
IEEE Transactions on Information Theory | 1996-11-24 | Paper |
Reed-Muller codes for error detection: the good, the bad, and the ugly
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
Lower bounds on multiple distinct sum sets
Discrete Mathematics | 1996-03-24 | Paper |
Codes correcting a single insertion/deletion of a zero or a single peak-shift
IEEE Transactions on Information Theory | 1995-09-17 | Paper |
Bounds on the worst case probability of undetected error
IEEE Transactions on Information Theory | 1995-08-01 | Paper |
The weight distribution of cosets
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
Bounds on the minimum support weights
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
Codes satisfying the chain condition
IEEE Transactions on Information Theory | 1994-10-04 | Paper |
Minimum support weights of binary codes
IEEE Transactions on Information Theory | 1993-09-16 | Paper |
Support weight distribution of linear codes
Discrete Mathematics | 1993-01-16 | Paper |
Generalized Hamming weights of linear codes
IEEE Transactions on Information Theory | 1992-09-27 | Paper |
The number of cross-join pairs in maximum length linear sequences
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Lower bounds on multiple difference sets
Discrete Mathematics | 1992-06-28 | Paper |
Optimal codes for error detection
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Constructions of $B_{h}[g$-sequences]
Acta Arithmetica | 1992-06-25 | Paper |
Bounds and constructions of disjoint sets of distinct difference sets
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Bounds and construction for difference triangle sets
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Bounds on the size of optimal difference triangle sets
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Using codes for error correction and detection (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Generalizations of the Korzhik bound (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
The probability of undetected error when a code is used for error correction and detection (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
The minimal range of additive $h$-bases.
MATHEMATICA SCANDINAVICA | 1983-01-01 | Paper |
On Robinson's coding problem (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Linear block codes for error detection (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
The modular n-queen problem. II
Discrete Mathematics | 1981-01-01 | Paper |
A lower bound for<tex>A(n,4,w)</tex>(Corresp.)
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
Upper bounds on codes correcting asymmetric errors (Corresp.)
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
On group-theoretic codes for asymmetric channels
Information and Control | 1981-01-01 | Paper |
A class of symmetric 2-bases.
MATHEMATICA SCANDINAVICA | 1980-01-01 | Paper |
Congruences for the partition function modulo powers of 5
Acta Arithmetica | 1980-01-01 | Paper |
On a conjecture of Bruckman.
MATHEMATICA SCANDINAVICA | 1979-01-01 | Paper |
On the no-three-in-line problem. III
Journal of Combinatorial Theory. Series A | 1979-01-01 | Paper |
Two non-closure results on families ofL languages
BIT | 1978-01-01 | Paper |
Noncovering of multiples.
MATHEMATICA SCANDINAVICA | 1978-01-01 | Paper |
The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
Discrete Mathematics | 1978-01-01 | Paper |
On the covering radius of binary codes (Corresp.)
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
The weight distribution for a class of irreducible cyclic codes
Discrete Mathematics | 1978-01-01 | Paper |
On the no-three-in-line problem. II
Journal of Combinatorial Theory. Series A | 1978-01-01 | Paper |
The modular n-queen problem
Discrete Mathematics | 1978-01-01 | Paper |
On complements of unary L languages
Journal of Computer and System Sciences | 1978-01-01 | Paper |
The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
Discrete Mathematics | 1977-01-01 | Paper |
Pumping languages†
International Journal of Computer Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3601644 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3482454 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3486356 (Why is no real title available?) | 1975-01-01 | Paper |
Sums of Distinct Elements from a Fixed Set
Mathematics of Computation | 1975-01-01 | Paper |
Representations of integers as sums of powers with increasing exponents — II
BIT | 1975-01-01 | Paper |
Expressing a prime as difference between two numbers containing all the previous primes
BIT | 1974-01-01 | Paper |
On Exponential Recurring Sequences.
MATHEMATICA SCANDINAVICA | 1974-01-01 | Paper |
Periodicity of Recurring Sequences in Rings.
MATHEMATICA SCANDINAVICA | 1974-01-01 | Paper |
Linear Recurring Sequences in Boolean Rings.
MATHEMATICA SCANDINAVICA | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3438978 (Why is no real title available?) | 1973-01-01 | Paper |
Representations of integers as sums of powers with increasing exponents
BIT | 1972-01-01 | Paper |
Power Sums of Integers with Missing Digits.
MATHEMATICA SCANDINAVICA | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3377310 (Why is no real title available?) | 1970-01-01 | Paper |
Density Problems for p (n )
Journal of the London Mathematical Society | 1970-01-01 | Paper |
Recurrence Formulae for the Coefficients of Modular Forms.
MATHEMATICA SCANDINAVICA | 1970-01-01 | Paper |
Recurrence Formulae for the Coefficients of Modular Forms and Congruences for the Partition Function and for the Coefficients of $j(\tau)$, $(j(\tau) - 1728)^{\frac{1}{2}}$ and $(j(\tau))^{\frac{1}{3}}$.
MATHEMATICA SCANDINAVICA | 1968-01-01 | Paper |
Congruence Properties and Density Problems for the Fourier Coefficients of Modular Forms.
MATHEMATICA SCANDINAVICA | 1968-01-01 | Paper |
