Torleiv Kløve

Cryptogr. Commun., 2019

2018

Codes of Length Two Correcting Single Errors of Limited Size II.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017

On Non-Linear Codes Correcting Errors of Limited Size.

[BibT_eX]

[DOI]

Massimo Battaglioni

Franco Chiaraluce

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Two Constructions of Covering Sets for Limited-Magnitude Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

On covering sets for limited-magnitude errors.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2016

2015

Codes of Length 2 Correcting Single Errors of Limited Size.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 15th IMA International Conference, 2015

2014

Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors.

[BibT_eX]

[DOI]

Moshe Schwartz

Des. Codes Cryptogr., 2014

Linear covering codes and error-correcting codes for limited-magnitude errors.

[BibT_eX]

[DOI]

Moshe Schwartz

Des. Codes Cryptogr., 2014

2013

Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories.

[BibT_eX]

[DOI]

Somaye Yari

IEEE Trans. Inf. Theory, 2013

2012

Codes Correcting Single Errors of Limited Magnitude.

[BibT_eX]

[DOI]

Jinquan Luo

Somaye Yari

IEEE Trans. Inf. Theory, 2012

Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes.

[BibT_eX]

[DOI]

Jinquan Luo

IEEE Trans. Inf. Theory, 2012

A Class of Punctured Simplex Codes Which Are Proper for Error Detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the generator matrix of array LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Software, 2012

On some linear codes that are proper for error detection.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011

Some Codes Correcting Asymmetric Errors of Limited Magnitude.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories.

[BibT_eX]

[DOI]

Noha Elarief

IEEE Trans. Inf. Theory, 2011

Lower bounds on the size of spheres of permutations under the Chebychev distance.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

The best possible upper bound on the probability of undetected error for linear codes of full support

[BibT_eX]

[DOI]

Jinquan Luo

CoRR, 2011

2010

Some necessary conditions for codes to be good for error detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Permutation arrays under the Chebyshev distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Proper self-complementary codes.

[BibT_eX]

[DOI]

Somaye Yari

Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009

Some optimal binary and ternary t-EC-AUED codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Constructing proper codes for error detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Generating Functions for the Number of Permutations with Limited Displacement.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

On the existence of proper codes for error detection.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Algebraic Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov-Tenengol'ts Codes.

[BibT_eX]

[DOI]

Marco Baldi

Franco Chiaraluce

IEEE Trans. Inf. Theory, 2008

2007

Generalized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

A Generic Construction of Cartesian Authentication Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes

[BibT_eX]

[DOI]

Marco Baldi

Franco Chiaraluce

CoRR, 2007

Distance preserving mappings from ternary vectors to permutations

[BibT_eX]

[DOI]

CoRR, 2007

The Probability of Undetected Error for Varshamov-Tenengol'ts Codes.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2007

Codes for Error Detection

[BibT_eX]

[DOI]

Series on Coding Theory and Cryptology 2, WorldScientific, ISBN: 978-981-4475-78-5, 2007

2006

A bound for codes with given minimum and maximum distances.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Binary Linear Codes That Are Optimal for Error Correction.

[BibT_eX]

[DOI]

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

The probability of undetected error for a class of asymmetric error detecting codes.

[BibT_eX]

[DOI]

Paul Oprisan

IEEE Trans. Inf. Theory, 2005

Diversity combining for the Z-channel.

[BibT_eX]

[DOI]

Paul Oprisan

IEEE Trans. Inf. Theory, 2005

Error-correction capability of binary linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Codes for error detection, good or not good

[BibT_eX]

[DOI]

CoRR, 2005

Codes for error detection, good or not good.

[BibT_eX]

[DOI]

Irina Gancheva

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Two constructions of permutation arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.

[BibT_eX]

[DOI]

Charles J. Colbourn

Alan C. H. Ling

IEEE Trans. Inf. Theory, 2004

On the second greedy weight for linear codes of dimension at least 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Probability of undetected error for a class of unidirectional error detecting codes.

[BibT_eX]

[DOI]

Paul Oprisan

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On two upper bounds on the size of t-EC-AUED codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On the undetected error probability for binary codes.

[BibT_eX]

[DOI]

Victor K.-W. Wei

IEEE Trans. Inf. Theory, 2003

Distance-preserving mappings from binary vectors to permutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets.

[BibT_eX]

[DOI]

Cunsheng Ding

Mordecai J. Golin

Des. Codes Cryptogr., 2003

On Equidistant Constant Weight Codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Weight hierarchies of linear codes satisfying the almost chain condition.

[BibT_eX]

[DOI]

Sci. China Ser. F Inf. Sci., 2003

A coset weight count that proves that the simplex codes are not optimal for error correction.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Constructions of permutation arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

The complement of binary linear codes for error detection.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001

On the Svanström bound for ternary constant-weight codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On Equidistant Constant Weight Codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Relations between the covering and Newton radii of binary codes.

[BibT_eX]

[DOI]

Discret. Math., 2001

Weight hierarchies of binary linear codes of dimension 4.

[BibT_eX]

[DOI]

Discret. Math., 2001

On the second greedy weight for linear codes of dimension 3.

[BibT_eX]

[DOI]

Discret. Math., 2001

Two classes of ternary codes and their weight distributions.

[BibT_eX]

[DOI]

Cunsheng Ding

Francesco Sica

Discret. Appl. Math., 2001

2000

The undetected error probability threshold of m-out-of-n codes.

[BibT_eX]

[DOI]

Shu-Tao Xia

IEEE Trans. Inf. Theory, 2000

1999

On the Newton and covering radii of linear codes.

[BibT_eX]

[DOI]

Ernst M. Gabidulin

IEEE Trans. Inf. Theory, 1999

On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set.

[BibT_eX]

[DOI]

Shi-Yi Shen

IEEE Trans. Inf. Theory, 1999

Weight Hierarchies of Extremal Non-Chain Binary Codes of Dimension 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On the Second Greedy Weight for Binary Linear Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Weight Hierarchies of Linear Codes Satisfying the Chain Condition.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1998

New Constructions of Disjoint Distinct Difference Sets.

[BibT_eX]

[DOI]

Zhi Chen

Des. Codes Cryptogr., 1998

How to Build Robust Shared Control Systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1998

1997

On the information function of an error-correcting code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

The Newton radius of codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Almost-MDS and near-MDS codes for error detection.

[BibT_eX]

[DOI]

Rossitza Dodunekova

Stefan M. Dodunekov

IEEE Trans. Inf. Theory, 1997

Bounds on the weight hierarchies of linear codes of dimension 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

On codes satisfying the double chain condition.

[BibT_eX]

[DOI]

Discret. Math., 1997

Disjoint sets of distinct sum sets.

[BibT_eX]

[DOI]

Discret. Math., 1997

Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

1996

Bounds on the weight distribution of cosets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Reed-Muller codes for error detection: the good, the bad, and the ugly.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

The worst case probability of undetected error for linear codes on the local binomial channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

The weight hierarchies of some product codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

The weight hierarchies of q -ary codes of dimension 4.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Lower bounds on multiple distinct sums sets.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Bounds on the worst case probability of undetected error.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Codes correcting a single insertion/deletion of a zero or a single peak-shift.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Bounds on the minimum support weights.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1995

Error detecting codes - general theory and their application in feedback communication systems.

[BibT_eX]

Valery I. Korzhik

The Kluwer international series in engineering and computer science 335, Kluwer, ISBN: 978-0-7923-9629-1, 1995

1994

The weight distribution of cosets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Codes satisfying the chain condition.

[BibT_eX]

[DOI]

Sylvia B. Encheva

IEEE Trans. Inf. Theory, 1994

1993

Minimum support weights of binary codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Generalizations of the Griesmer Bound.

[BibT_eX]

[DOI]

Øyvind Ytrehus

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992

Optimal codes for error detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Generalized Hamming weights of linear codes.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1992

Support weight distribution of linear codes.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

The number of cross-join pairs in maximum length linear sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Lower bounds on multiple difference sets.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

Bounds and constructions of disjoint sets of distinct difference sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

1989

Bounds and construction for difference triangle sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

Bounds on the size of optimal difference triangle sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1984

The probability of undetected error when a code is used for error correction and detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

Using codes for error correction and detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

Generalizations of the Korzhik bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

The Detection of Errors After Error-Correction Decoding.

[BibT_eX]

[DOI]

Michael Miller

IEEE Trans. Commun., 1984

1983

On Robinson's coding problem.

[BibT_eX]

IEEE Trans. Inf. Theory, 1983

Linear block codes for error detection.

[BibT_eX]

[DOI]

Tadao Kasami

Shu Lin

IEEE Trans. Inf. Theory, 1983

1981

On Group-Theoretic Codes for Assymmetric Channels

[BibT_eX]

[DOI]

Inf. Control., April, 1981

A lower bound for A(n, 4, w).

[BibT_eX]

IEEE Trans. Inf. Theory, 1981

Upper bounds on codes correcting asymmetric errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

The modular n-queen problem II.

[BibT_eX]

[DOI]

Discret. Math., 1981

1979

On the No-Three-in-Line Problem, III.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1979

1978

On the covering radius of binary codes (Corresp.).

[BibT_eX]

[DOI]

Johannes Mykkeltveit

IEEE Trans. Inf. Theory, 1978

On the No-Three-in-Line Problem, II.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

On Complements of Unary L Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>).

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

The modular n-queen problem.

[BibT_eX]

[DOI]

Discret. Math., 1977

The weight distribution for a class of irreducible cyclic codes.

[BibT_eX]

[DOI]

Discret. Math., 1977

The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N).

[BibT_eX]

[DOI]