Torleiv Kløve

According to our database1, Torleiv Kløve authored at least 117 papers between 1977 and 2019.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2003, "For contributions to coding theory and error-detecting codes.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Codes of length two correcting single errors of limited size.
Cryptogr. Commun., 2019

2018
Codes of Length Two Correcting Single Errors of Limited Size II.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017
On Non-Linear Codes Correcting Errors of Limited Size.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
Two Constructions of Covering Sets for Limited-Magnitude Errors.
IEEE Trans. Inf. Theory, 2016

On covering sets for limited-magnitude errors.
Cryptogr. Commun., 2016

2015
Codes of Length 2 Correcting Single Errors of Limited Size.
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.
Des. Codes Cryptogr., 2014

Linear covering codes and error-correcting codes for limited-magnitude errors.
Des. Codes Cryptogr., 2014

2013
Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories.
IEEE Trans. Inf. Theory, 2013

2012
Codes Correcting Single Errors of Limited Magnitude.
IEEE Trans. Inf. Theory, 2012

Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes.
IEEE Trans. Inf. Theory, 2012

A Class of Punctured Simplex Codes Which Are Proper for Error Detection.
IEEE Trans. Inf. Theory, 2012

On the generator matrix of array LDPC codes.
Proceedings of the 20th International Conference on Software, 2012

On some linear codes that are proper for error detection.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011
Some Codes Correcting Asymmetric Errors of Limited Magnitude.
IEEE Trans. Inf. Theory, 2011

Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories.
IEEE Trans. Inf. Theory, 2011

Lower bounds on the size of spheres of permutations under the Chebychev distance.
Des. Codes Cryptogr., 2011

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

2010
Some necessary conditions for codes to be good for error detection.
IEEE Trans. Inf. Theory, 2010

Permutation arrays under the Chebyshev distance.
IEEE Trans. Inf. Theory, 2010

Proper self-complementary codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
Some optimal binary and ternary t-EC-AUED codes.
IEEE Trans. Inf. Theory, 2009

Constructing proper codes for error detection.
IEEE Trans. Inf. Theory, 2009

Generating Functions for the Number of Permutations with Limited Displacement.
Electron. J. Comb., 2009

On the existence of proper codes for error detection.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Algebraic Coding Theory.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations.
IEEE Trans. Inf. Theory, 2008

Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov-Tenengol'ts Codes.
IEEE Trans. Inf. Theory, 2008

2007
Generalized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors.
IEEE Trans. Inf. Theory, 2007

A Generic Construction of Cartesian Authentication Codes.
IEEE Trans. Inf. Theory, 2007

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

Distance preserving mappings from ternary vectors to permutations
CoRR, 2007

The Probability of Undetected Error for Varshamov-Tenengol'ts Codes.
Proceedings of IEEE International Conference on Communications, 2007

Codes for Error Detection
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.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Binary Linear Codes That Are Optimal for Error Correction.
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.
IEEE Trans. Inf. Theory, 2005

Diversity combining for the Z-channel.
IEEE Trans. Inf. Theory, 2005

Error-correction capability of binary linear codes.
IEEE Trans. Inf. Theory, 2005

Codes for error detection, good or not good
CoRR, 2005

Codes for error detection, good or not good.
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.
IEEE Trans. Inf. Theory, 2004

Two constructions of permutation arrays.
IEEE Trans. Inf. Theory, 2004

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.
IEEE Trans. Inf. Theory, 2004

On the second greedy weight for linear codes of dimension at least 4.
IEEE Trans. Inf. Theory, 2004

Probability of undetected error for a class of unidirectional error detecting codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On two upper bounds on the size of t-EC-AUED codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the undetected error probability for binary codes.
IEEE Trans. Inf. Theory, 2003

Distance-preserving mappings from binary vectors to permutations.
IEEE Trans. Inf. Theory, 2003

Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes.
Des. Codes Cryptogr., 2003

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets.
Des. Codes Cryptogr., 2003

On Equidistant Constant Weight Codes.
Discret. Appl. Math., 2003

Weight hierarchies of linear codes satisfying the almost chain condition.
Sci. China Ser. F Inf. Sci., 2003

A coset weight count that proves that the simplex codes are not optimal for error correction.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
Constructions of permutation arrays.
IEEE Trans. Inf. Theory, 2002

The complement of binary linear codes for error detection.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
On the Svanström bound for ternary constant-weight codes.
IEEE Trans. Inf. Theory, 2001

On Equidistant Constant Weight Codes.
Electron. Notes Discret. Math., 2001

Relations between the covering and Newton radii of binary codes.
Discret. Math., 2001

Weight hierarchies of binary linear codes of dimension 4.
Discret. Math., 2001

On the second greedy weight for linear codes of dimension 3.
Discret. Math., 2001

Two classes of ternary codes and their weight distributions.
Discret. Appl. Math., 2001

2000
The undetected error probability threshold of m-out-of-n codes.
IEEE Trans. Inf. Theory, 2000

1999
On the Newton and covering radii of linear codes.
IEEE Trans. Inf. Theory, 1999

On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set.
IEEE Trans. Inf. Theory, 1999

Weight Hierarchies of Extremal Non-Chain Binary Codes of Dimension 4.
IEEE Trans. Inf. Theory, 1999

On the Second Greedy Weight for Binary Linear Codes.
Proceedings of the Applied Algebra, 1999

1998
Weight Hierarchies of Linear Codes Satisfying the Chain Condition.
Des. Codes Cryptogr., 1998

New Constructions of Disjoint Distinct Difference Sets.
Des. Codes Cryptogr., 1998

How to Build Robust Shared Control Systems.
Des. Codes Cryptogr., 1998

1997
On the information function of an error-correcting code.
IEEE Trans. Inf. Theory, 1997

The Newton radius of codes.
IEEE Trans. Inf. Theory, 1997

Almost-MDS and near-MDS codes for error detection.
IEEE Trans. Inf. Theory, 1997

Bounds on the weight hierarchies of linear codes of dimension 4.
IEEE Trans. Inf. Theory, 1997

On codes satisfying the double chain condition.
Discret. Math., 1997

Disjoint sets of distinct sum sets.
Discret. Math., 1997

Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4.
Appl. Algebra Eng. Commun. Comput., 1997

1996
Bounds on the weight distribution of cosets.
IEEE Trans. Inf. Theory, 1996

Reed-Muller codes for error detection: the good, the bad, and the ugly.
IEEE Trans. Inf. Theory, 1996

The worst case probability of undetected error for linear codes on the local binomial channel.
IEEE Trans. Inf. Theory, 1996

The weight hierarchies of some product codes.
IEEE Trans. Inf. Theory, 1996

The weight hierarchies of q -ary codes of dimension 4.
IEEE Trans. Inf. Theory, 1996

Lower bounds on multiple distinct sums sets.
Discret. Math., 1996

1995
Bounds on the worst case probability of undetected error.
IEEE Trans. Inf. Theory, 1995

Codes correcting a single insertion/deletion of a zero or a single peak-shift.
IEEE Trans. Inf. Theory, 1995

Bounds on the minimum support weights.
IEEE Trans. Inf. Theory, 1995

Error detecting codes - general theory and their application in feedback communication systems.
The Kluwer international series in engineering and computer science 335, Kluwer, ISBN: 978-0-7923-9629-1, 1995

1994
The weight distribution of cosets.
IEEE Trans. Inf. Theory, 1994

Codes satisfying the chain condition.
IEEE Trans. Inf. Theory, 1994

1993
Minimum support weights of binary codes.
IEEE Trans. Inf. Theory, 1993

Generalizations of the Griesmer Bound.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992
Optimal codes for error detection.
IEEE Trans. Inf. Theory, 1992

Generalized Hamming weights of linear codes.
IEEE Trans. Inf. Theory, 1992

Support weight distribution of linear codes.
Discret. Math., 1992

1991
The number of cross-join pairs in maximum length linear sequences.
IEEE Trans. Inf. Theory, 1991

Lower bounds on multiple difference sets.
Discret. Math., 1991

1990
Bounds and constructions of disjoint sets of distinct difference sets.
IEEE Trans. Inf. Theory, 1990

1989
Bounds and construction for difference triangle sets.
IEEE Trans. Inf. Theory, 1989

1988
Bounds on the size of optimal difference triangle sets.
IEEE Trans. Inf. Theory, 1988

1984
The probability of undetected error when a code is used for error correction and detection.
IEEE Trans. Inf. Theory, 1984

Using codes for error correction and detection.
IEEE Trans. Inf. Theory, 1984

Generalizations of the Korzhik bound.
IEEE Trans. Inf. Theory, 1984

The Detection of Errors After Error-Correction Decoding.
IEEE Trans. Commun., 1984

1983
On Robinson's coding problem.
IEEE Trans. Inf. Theory, 1983

Linear block codes for error detection.
IEEE Trans. Inf. Theory, 1983

1981
On Group-Theoretic Codes for Assymmetric Channels
Inf. Control., April, 1981

A lower bound for A(n, 4, w).
IEEE Trans. Inf. Theory, 1981

Upper bounds on codes correcting asymmetric errors.
IEEE Trans. Inf. Theory, 1981

The modular n-queen problem II.
Discret. Math., 1981

1979
On the No-Three-in-Line Problem, III.
J. Comb. Theory, Ser. A, 1979

1978
On the covering radius of binary codes (Corresp.).
IEEE Trans. Inf. Theory, 1978

On the No-Three-in-Line Problem, II.
J. Comb. Theory, Ser. A, 1978

On Complements of Unary L Languages.
J. Comput. Syst. Sci., 1978

The weight distribution of linear codes over GF(q<sup>l</sup>) having generator matrix over GF(q>).
Discret. Math., 1978

1977
The modular n-queen problem.
Discret. Math., 1977

The weight distribution for a class of irreducible cyclic codes.
Discret. Math., 1977

The weight distribution of irreducible cyclic codes with block lengths n<sub>1</sub>((q<sup>1</sup>-1)/N).
Discret. Math., 1977


  Loading...