Torleiv Kløve: Selected Publications

Books:

Torleiv Kløve,
Codes for Error Detection.
World Scientific, Singapore, 2007, 219 pp.
ISBN 978-981-270-586-0
Pub. date: Scheduled Summer 2007.

Torleiv Kløve and Valery Korzhik,
Error Detecting Codes, General Theory and their Application in Feedback Communication Systems.
Kluwer Acad. Publ. 1995. 264 pp.
ISBN 0-7923-9629-4

Papers on:

• Codes for error detection and related topics
• Support weights (Generalized Hamming weights) and related topics
• Difference triangle sets and related topics
• Other topics

• Optimal codes for error detection, IEEE Transactions on Information Theory, vol. 38, pp. 479-489, 1992.

• Optimal codes for error detection, IEEE Transactions on Information Theory, vol. 38, pp. 479-489, 1992.

• The weight distribution of cosets, IEEE Transactions on Information Theory, vol. 40, pp. 911-913, 1994.

• Bounds on the worst-case probability of undetected error, IEEE Transactions on Information Theory, vol. 41, pp. 298-300, 1995.

• The worst-case probability of undetected error for linear codes on the local binomial channel, IEEE Transactions on Information Theory, vol. 42, pp. 172-179, 1996.

• Reed-Muller codes for error detection, the good, the bad, and the ugly, IEEE Transactions on Information Theory, vol. 42, pp. 1615-1622, 1996.

• Bounds on the weight distribution of cosets, IEEE Transactions on Information Theory, vol. 42, pp. 2257-2260, 1996.

• Almost MDS and near MDS codes for error detection (with R. Dodunekova and S. Dodunekov), IEEE Transactions on Information Theory, vol. 43, pp. 285-290, 1997.

• Diversity combining for the Z-channel (with P. Oprisan and B. Bose), IEEE Transactions on Information Theory, vol. 51, pp. pp. 1174-1178, 2005.

• The probability of undetected error for a class of asymmetric error detecting codes (with P. Oprisan and B. Bose), IEEE Transactions on Information Theory, vol. 51, pp. 1202-1205, 2005.

• Generalized Bose-Lin codes, a class of codes detecting asymmetric errors (with I. Naydenova),
  IEEE Trans. Information Theory, vol. 52, pp. 1188-1193, 2007.

• The weight distribution of irreducible cyclic codes with block lengths $n$₁((q^l-1)/N) (with T. Helleseth and J.Mykkeltveit), Discrete Mathematics, vol. 18, pp. 179-211, 1977.

• The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q), Discrete Mathematics, vol. 23, pp. 159-168, 1978.

• Generalized Hamming weights of linear codes (with T. Helleseth and Ø. Ytrehus), IEEE Transactions on Information Theory, vol. 38, pp. 1133-1140, 1992.

• Support weight distribution of linear codes, Discrete Mathematics, vol. 106/107, pp. 311-316, 1992

• Minimum support weights of binary codes, IEEE Transactions on Information Theory, vol. 39, pp. 648-654, 1993.

• Generalizations of the Griesmer bound (with T. Helleseth and Ø. Ytrehus), in A. Chmona and S. B. Wicker (ed.) Error Control, Cryptography and Speech Compression , Springer Lecture Notes on Computer Science 829, 41-52, 1994.

• Codes satisfying the chain condition (with Sylvia Encheva), IEEE Transactions on Information Theory, vol. 40, pp. 175-180, 1994.

• Bounds on the minimum support weights (with T. Helleseth, V. Levenshtein, and Ø. Ytrehus), IEEE Transactions on Information Theory, vol. 41, pp. 432-440, 1995.

• The weight hierarchies of some product codes (with T. Helleseth), IEEE Transactions on Information Theory, vol. 42, pp. 1029-1034, 1996.

• The weight hierarchies of q-ary codes of dimension 4 (with W. Chen), IEEE Transactions on Information Theory, pp. 2265-2272, 1996.

• Bounds on the weight hierarchies of extremal non-chain codes of dimension 4 (with W. Chen), Applicable Algebra in Eng., Commun. and Computing, vol. 8, pp. 379-386, 1997.

• On codes satisfying the double chain condition, Discrete Mathematics, vol. 175, pp. 173-195, 1997.

• Bounds on the weight hierarchies of linear codes of dimension 4 (with Wende Chen), IEEE Trans. Inform. Theory, vol. 43, pp. 2047-2054, 1997.

• Weight hierarchies of linear codes satisfying the chain condition ( with Wende Chen), Designs, Codes and Cryptography, vol. 15, pp. 47-66, 1998.

• Weight hierarchies of extremal non-chain binary codes of dimension 4 (with Wende Chen), IEEE Trans. Inf. Theory, vol. 45, pp. 276-282, 1999.

• Weight hierarchies of linear codes of dimension 3 (with W. Chen), Journal of Statistical Planning and Inference , vol. 34, no.2, pp. 167-179, 2001.

• Classification of the weight hierarchies of binary linear codes of dimension 4 (with W. Chen), Report no. 147, Department of Informatics, University of Bergen, March 1998.

• Bounds on the size of optimal difference sets, IEEE Transactions on Information Theory, vol. IT-34, pp. 355-361, 1988

• Bounds and constructions for difference triangle sets, IEEE Transactions on Information Theory, vol. IT-35, pp. 879-886, 1989

• Bounds and constructions of disjoint sets of distinct difference sets, IEEE Transactions on Information Theory, vol. IT-36, pp. 184-190, 1990

• Constructions of $B$_h[g]-sequences, Acta Arithmetica, vol. 58, pp. 65-78, 1991

• Lower bounds on multiple difference sets (with W. Chen), Discrete Mathematics, vol. 98, pp. 9-21, 1991

• Lower bounds of intermodulation-free frequencies assignment (in Chinese) (with W. Chen and D. Li), Kexue Tongbao, vol. 37, no. 12, pp. 2015-2016, 1992

• Lower bounds on multiple distict sums sets (with W. Chen), Discrete Mathematics, vol. 148, pp. 15-35, 1996

• On generalization of sonar sequences and intermodulation-free frequencies assignment sequences (with W. Chen), Acta Mathematics Appl. Sinica, vol. 12, no. 1, pp. 102-108, 1996

• Disjoint sets of distinct sum sets (with W. Chen), Discrete Mathematics, vol. 175, pp. 69-77, 1997

• New constructions of disjoint distinct difference sets (with W. Chen and Z. Chen), Designs, Codes and Cryptography, vol. 15, pp. 157-165, 1998.

• Diffuse Difference Triangle Sets (with Y. Svirid), Journal of Statistical Planning and Inference , vol. 34, no. 2, pp. 255-276, 2001.

• Error Correcting Codes for the Asymmetric Channel , Report, Department of Mathematics, University of Bergen, 1981/1983. Bibliography updated 1995. 88 pages.

• The number of cross-join pairs in maximum length linear sequences (with T. Helleseth), IEEE Transactions on Information Theory, vol. 37, pp. 1731-1733, 1991

• Codes correcting a single insertion/deletion of a zero or a single peak-shift, IEEE Transactions on Information Theory, vol. 41, pp. 279-283, 1995

• On the information function of an error correcting code (with T. Helleseth and V. Levenshtein), IEEE Transactions on Information Theory, vol. 43, pp. 549-557, 1997

• The Newton radius of codes (with T. Helleseth), IEEE Trans. Inform. Theory, vol. 43, pp. 1820-1831, 1997

• How to build robust shared control systems (with R. Anderson, C. Ding, T.Helleseth), Designs, Codes and Cryptography, vol. 15, pp. 111-124, 1998.

• On the Hamming Distance Between Two i.i.d. Random Vectors Over GF(q) (with Fang-Wei Fu and Shi-Yi Shen), IEEE Trans. Inf. Theory, vol. 45, pp. 803-807, 1999.

• On the Newton and Covering Radii of Linear Codes (with E. Gabidulin), IEEE Trans. Inform. Theory, vol. 45, pp. 2534-2536, 1999.