Torleiv Kløve's picture
Torleiv
Kløve
Professor
Visit Address: 
HIB - Thormøhlensgt. 55
5020 Bergen
Postal Address: 
Postboks 7803
5020 Bergen
Phone: 
+47 55 58 41 51
Download vCard
Books
  • Kløve, Torleiv. 2007. Codes for error detection. World Scientific. 201 pages. ISBN: 9789812705860.
  • Naydenova, Irina; Kløve, Torleiv. 2006. Necessary conditions for codes to be good for error detection. 31 pages. ISBN: 954-8324-96-2.
  • Kløve, Torleiv; Korzhik, Valery I. 1995. Error detecting codes, General Theory And Their Application In Feedback Communication Systems. 250 pages.
Journal articles
  • Kløve, Torleiv; Schwartz, Moshe. 2014. Linear covering codes and error-correcting codes for limited-magnitude errors. Designs, Codes and Cryptography. 73: 329-354. doi: 10.1007/s10623-013-9917-1
  • Kløve, Torleiv; Schwartz, Moshe. 2014. Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors. Designs, Codes and Cryptography. 73: 1029-1029. doi: 10.1007/s10623-014-9991-z
  • Yari, Somaye; Kløve, Torleiv; Bose, Bella. 2013. Some codes correcting unbalanced errors of limited magnitude. IEEE Transactions on Information Theory. 59: 7278-7287. doi: 10.1109/TIT.2013.2279792
  • Baldi, Marco; Bianchi, Marco; Chiaraluce, Franco; Kløve, Torleiv. 2012. A class of punctured simplex codes which are proper for error detection. IEEE Transactions on Information Theory. 58: 3861-3880. doi: 10.1109/TIT.2012.2188711
  • Kløve, Torleiv; Luo, Jinquan. 2012. Upper bounds on the weight distribution function for some classes of linear codes. IEEE Transactions on Information Theory. 58: 5512-5521. doi: 10.1109/TIT.2012.2197176
  • Kløve, Torleiv; Luo, Jinquan; Yari, Somaye. 2012. Codes correcting single errors of limited magnitude. IEEE Transactions on Information Theory. 58: 2206-2219. doi: 10.1109/TIT.2011.2179007
  • Kløve, Torleiv. 2011. Lower bounds on the size of spheres of permutations under the Chebychev distance. Designs, Codes and Cryptography. 59: 183-191. doi: 10.1007/s10623-010-9454-0
  • Kløve, Torleiv; Bose, Bella; Elarief, Noha. 2011. Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories. IEEE Transactions on Information Theory. 57: 4477-4487. doi: 10.1109/TIT.2011.2146330
  • Kløve, Torleiv; Luo, Jinquan; Naydenova, Irina; Yari, Somaye. 2011. Some Codes Correcting Asymmetric Errors of Limited Magnitude. IEEE Transactions on Information Theory. 57: 7459-7472. doi: 10.1109/TIT.2011.2160839
  • Kløve, Torleiv; Lin, Te-Tsung; Tsai, Shi-Chun; Tzeng, Wen-Guey. 2010. Permutation arrays under the Chebyshev distance. IEEE Transactions on Information Theory. 56: 2611-2617. doi: 10.1109/TIT.2010.2046212
  • Naydenova, Irina; Kløve, Torleiv. 2010. Some necessary conditions for codes to be good for error detection. IEEE Transactions on Information Theory. 56: 1023-1027. doi: 10.1109/TIT.2009.2039044
  • Kløve, Torleiv. 2009. Generating functions for the number of permutations with limited displacement. The Electronic Journal of Combinatorics. 16. 11 pages. Published 2009-08-14.
  • Kløve, Torleiv. 2009. Constructing proper codes for error detection. IEEE Transactions on Information Theory. 55: 3520-3525. doi: 10.1109/TIT.2009.2023712
  • Naydenova, Irina; Kløve, Torleiv. 2009. Some optimal binary and ternary t-EC-AUED codes. IEEE Transactions on Information Theory. 55: 4898-4904. doi: 10.1109/TIT.2009.2030480
  • Baldi, Marco; Chiaraluce, Franco; Kløve, Torleiv. 2008. Exact and approximate expressions for the probability of undetected errors of Varshamov-Tenengol'ts codes. IEEE Transactions on Information Theory. 54: 5019-5029. doi: 10.1109/TIT.2008.929912
  • Lin, Jyh-Shyan; Chang, Jen-Chun; Chen, Rong-Jaye; Kløve, Torleiv. 2008. Distance-preserving and distance-increasing mappings from ternary vectors to permutations. IEEE Transactions on Information Theory. 54: 1334-1339. doi: 10.1109/TIT.2007.915706
  • Ding, Cunsheng; Helleseth, Tor; Kløve, Torleiv; Wang, Xuesong. 2007. A generic construction of cartesian authentication codes. IEEE Transactions on Information Theory. 53: 2229-2235. doi: 10.1109/TIT.2007.896872
  • Naydenova, Irina; Kløve, Torleiv. 2007. Generalized Bose-Lin codes, a class of codes detecting asymmetric errors. IEEE Transactions on Information Theory. 53: 1188-1193. doi: 10.1109/TIT.2006.890776
  • Kløve, Torleiv. 2006. Binary linear codes that are optimal for error correction. Lecture Notes in Computer Science. 4123: 1081-1083.
  • Chen, Wende; Kløve, Torleiv. 2005. On the second greedy weight for linear codes satisfying the fullrank condition. Journal of Systems Science and Complexity. 18: 55-66.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, Vladimir. 2005. Error-correction capability of binary linear codes. IEEE Transactions on Information Theory. 51: 1408-1423.
  • Kløve, Torleiv; Oprisan, Paul; Bose, Bella. 2005. The probability of undetected error for a class of asymmetric error detecting codes. IEEE Transactions on Information Theory. 51: 1202-1205.
  • Kløve, Torleiv; Oprisan, Paul; Bose, Bella. 2005. Diversity combining for the Z-channel. IEEE Transactions on Information Theory. 51: 1174-1178.
  • Chen, Wende; Kløve, Torleiv. 2004. On the second greedy weight for linear codes of dimension at least 4. IEEE Transactions on Information Theory. 50: 354-356.
  • Chen, Wende; Kløve, Torleiv. 2004. Finite projective geometries and classification of the weight hierarchies of codes (I). Acta Mathematica Sinica. English series. 20: 333-348.
  • Colbourn, CJ; Kløve, Torleiv; Ling, ACH. 2004. Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Transactions on Information Theory. 50: 1289-1291.
  • Fu, Fangwei; Kløve, Torleiv. 2004. Two constructions of permutation arrays. IEEE Transactions on Information Theory. 50: 881-883.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, Vladimir. 2004. The simplex codes and other even-weight binary linear codes for error correction. IEEE Transactions on Information Theory. 50: 2818-2823.
  • Chang, Jen-Chun; Chen, Rong-Jaye; Kløve, Torleiv; Tsai, Shi-Chun. 2003. Distance preserving mappings from binary vectors to permutations. IEEE Transactions on Information Theory. 49: 1054-1059.
  • Chen, Wende; Kløve, Torleiv. 2003. Weight hierarchies of linear codes satisfying the almost chain condition. Science in China. Series F, Information Sciences. 46: 175-186.
  • Ding, Cunsheng; Golin, Mordecai; Kløve, Torleiv. 2003. Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Designs, Codes and Cryptography. 30: 73-84.
  • Fu, Fangwei; Kløve, Torleiv; Luo, Yuan; Wei, Victor. 2003. On equidistant constant weight codes. Discrete Applied Mathematics. 128: 157-164.
  • Fu, Fangwei; Kløve, Torleiv; Wei, Victor. 2003. On the Undetected Error Probability for Binary Codes. IEEE Transactions on Information Theory. 49: 382-390.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, Vladimir. 2003. Hypercubic 4 and 5-designs from double-error-correcting BCH codes. Designs, Codes and Cryptography. 28: 265-282.
  • Ding, Cunsheng; Fu, Fangwei; Kløve, Torleiv; Wei, Victor. 2002. Constructions of permutation arrays. IEEE Transactions on Information Theory. 48: 977-980.
  • Chen, Wende; Kløve, Torleiv. 2001. Weight hierarchies of linear codes of dimension 3. Journal of Statistical Planning and Inference. 94: 167-179.
  • Chen, Wende; Kløve, Torleiv. 2001. On the second greedy weight for linear codes of dimension 3. Discrete Mathematics. 241: 171-187.
  • Chen, Wende; Kløve, Torleiv. 2001. Weight hierarchies of binary linear codes of dimension 4. Discrete Mathematics. 238: 27-34.
  • Ding, Cunsheng; Kløve, Torleiv; Sica, Francesco. 2001. Two classes of ternary codes and their weight distributions. Discrete Applied Mathematics. 111: 37-53.
  • Fu, Fangwei; Kløve, Torleiv; Luo, Yuan; Wei, Victor. 2001. On the Svanström Bound for Ternary Constant Weight Codes. IEEE Transactions on Information Theory. 47: 2061-2064.
  • Kløve, Torleiv. 2001. Relations between the covering and Newton radii of binary codes. Discrete Mathematics. 238: 81-88.
  • Kløve, Torleiv; Svirid, Yuri. 2001. Diffuse difference triangle sets. Journal of Statistical Planning and Inference. 94: 255-276.
  • Chen, Wende; Kløve, Torleiv. 2000. Lower bound on K-sequence. Systems Science and Mathematical Science. 13: 225-230.
  • Fu, Fangwei; Kløve, Torleiv; Xia, Shutao. 2000. The undetected error probability threshold of m-out-of-n codes. IEEE Transactions on Information Theory. 46: 1597-1599.
  • Chen, Wende; Kløve, Torleiv. 1999. Weight hierarchies of extremal non-chain binary codes of dimension 4. IEEE Transactions on Information Theory. 45: 276-281.
  • Kløve, Torleiv; Fu, Fangwei; Shen, Shi-Yi. 1999. On the Hamming Distance Between Two i.i.d. Random Vectors Over GF(q). IEEE Transactions on Information Theory. 45: 803-807.
  • Kløve, Torleiv; Gabidulin, Ernst. 1999. On the Newton and covering radii of linear codes. IEEE Transactions on Information Theory. 45: 2534-2536.
  • Anderson, R.; Ding, C.; Helleseth, Tor; Kløve, Torleiv. 1998. How to build robust shared control systems. Designs, Codes and Cryptography. 1998: 111-124.
  • Chen, Weiqin; Chen, Z.; Kløve, Torleiv. 1998. New constructions of disjoint distinct difference sets. Designs, Codes and Cryptography. 15: 157-165.
  • Chen, Weiqin; Kløve, Torleiv. 1998. Weight hierarchies of linear codes satisfying the chain condition. Designs, Codes and Cryptography. 11: 47-66.
  • Chen, Wende; Kløve, Torleiv. 1997. Bounds on the weight hierarchies of linear codes of dimension 4. IEEE Transactions on Information Theory. 43: 2047-2054.
  • Chen, Wende; Kløve, Torleiv. 1997. Disjoint sets of distinct sum sets. Discrete Mathematics. 175: 69-77.
  • Chen, Wende; Kløve, Torleiv. 1997. Bounds on the weight hierarchies of extremal non-chain codes of dimension 4. Applicable Algebra in Engineering, Communication and Computing. 8: 379-386.
  • Dodunekova, Rossitza; Dodunekov, Stefan; Kløve, Torleiv. 1997. Almost MDS and Near MDS Codes for Error Detection. IEEE Transactions on Information Theory. 43: 285-290.
  • Helleseth, Tor; Kløve, Torleiv. 1997. The Newton radius of codes. IEEE Transactions on Information Theory. 43: 1820-1831.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, Vladimir. 1997. On the information function of an error-correcting code. IEEE Transactions on Information Theory. 43: 549-557.
  • Kløve, Torleiv. 1997. On codes satisfying the double chain condition. Discrete Mathematics. 175: 173-195.
  • Chen, Wende; Kløve, Torleiv. 1996. The weight hierarchies of q-ary codes of dimension 4. IEEE Transactions on Information Theory. 2265-2272.
  • Chen, Wende; Kløve, Torleiv. 1996. On generalizations of sonar sequences and intermodulation-free frequencies assignment sequences. Acta Mathematicae Applicatae Sinica (English Series). 12: 102-108.
  • Helleseth, Tor; Kløve, Torleiv. 1996. The weight hierarchies of some product codes. IEEE Transactions on Information Theory. 42: 1029-1034.
  • Kløve, Torleiv. 1996. The worst-case probability of undetected error for linear codes on the local binomial channel. IEEE Transactions on Information Theory. 42: 172-179.
  • Kløve, Torleiv. 1996. Bounds on the weight distribution of cosets. IEEE Transactions on Information Theory. 42: 2257-2260.
  • Kløve, Torleiv. 1996. Reed-Muller codes for error detection; the good, the bad, and the ugly. IEEE Transactions on Information Theory. 42: 1615-1622.
  • Kløve, Torleiv; Chen, Wende. 1996. Lower bounds on multiple distict sums sets. Discrete Mathematics. 148: 15-35.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, V. I.; Ytrehus, Øyvind. 1995. Bounds on the Minimum Support Weights. IEEE Transactions on Information Theory. 41: 432-440.
  • Kløve, Torleiv. 1995. Codes correcting a single insertion/deletion of a zero or a single peak-shift. IEEE Transactions on Information Theory. 41: 279-283.
  • Kløve, Torleiv. 1995. Bounds on the Worst case Probability of Undetected Error. IEEE Transactions on Information Theory. 41: 298-300.
  • Encheva, S.; Kløve, Torleiv. 1994. Codes satisfying the chain condition. IEEE Transactions on Information Theory. IT-40: 175-180.
  • Helleseth, Tor; Kløve, Torleiv; Ytrehus, Øyvind. 1994. Generalizations of the Griesmer bound. Error Control, Cryptography and Speech Compression. Lecture Notes in Computer Science. 829: 41-52.
  • Kløve, Torleiv. 1994. The weight distribution of cosets. IEEE Transactions on Information Theory. IT-40: 911-913.
  • Kløve, Torleiv. 1993. Minimum support weights of binary codes. IEEE Transactions on Information Theory. IT-39: 648-654.
  • Helleseth, Tor; Kløve, Torleiv; Ytrehus, Øyvind. 1992. Generalized Hamming weights of linear codes. IEEE Transactions on Information Theory. 38: 1133-1140.
  • Kløve, Torleiv. 1992. Support weight distribution of linear codes. Discrete Mathematics. 107: 311-316.
  • Kløve, Torleiv. 1992. Optimal codes for error detection. IEEE Transactions on Information Theory. IT-38: 479-489.
  • Helleseth, Tor; Kløve, Torleiv. 1991. The number of cross-join pairs in maximum lenght linear sequences. IEEE Transactions on Information Theory. 37.
  • Kløve, Torleiv. 1991. Constructions of Bh@<g@>-sequences. Acta Arithmetica. 58: 65-78.
  • Kløve, Torleiv; Chen, Weiqin. 1991. Lower bounds on multiple difference sets. Discrete Mathematics. 98: 9-21.
  • Kløve, Torleiv. 1990. Bounds and constructions of disjoint sets of distinct difference sets. IEEE Transactions on Information Theory. 36: 184-190.
  • Kløve, Torleiv. 1989. Bounds and constructions for difference triangle sets. IEEE Transactions on Information Theory. 35: 879-886.
  • Kløve, Torleiv. 1988. Bounds on the size of optimal difference sets. IEEE Transactions on Information Theory. 34: 355-361.
  • Kløve, Torleiv. 1984. Generalizations of the Korzhik Bound. IEEE Transactions on Information Theory. 30: 771-773.
  • Kløve, Torleiv. 1984. The Probability of Undetected Error When a Code Is Used for Error Correction and Detection. IEEE Transactions on Information Theory. 30: 388-392.
  • Kløve, Torleiv. 1984. Using Codes for Error Correction and Detection. IEEE Transactions on Information Theory. 30: 868-871.
  • Kløve, Torleiv; Miller, Michael. 1984. The Detection of Error After Error-correction decoding. IEEE Transactions on Communications. 32: 511-517.
  • Kasami, Tadao; Kløve, Torleiv; Lin, Shu. 1983. Linear Block Codes for Error Detection. IEEE Transactions on Information Theory. 29: 131-136.
  • Kløve, Torleiv. 1983. The minimal range of additive h-bases. Mathematica Scandinavica. 53: 157-177.
  • Kløve, Torleiv. 1983. On Robinson's Coding Problem. IEEE Transactions on Information Theory. 29: 450-454.
  • Helleseth, Tor; Kløve, Torleiv. 1981. On group-theoretic codes for asymmetric channels. Information and Computation. 49: 1-9.
  • Kløve, Torleiv. 1981. Upper bounds on codes correcting asymmetric errors. IEEE Transactions on Information Theory. 27: 128-131.
  • Kløve, Torleiv. 1981. The modular n-queen problem II. Discrete Mathematics. 36: 33-48.
  • Kløve, Torleiv. 1981. A lower bound for A(n,4,w). IEEE Transactions on Information Theory. 27: 257-258.
  • Kløve, Torleiv. 1980. A class of symmetric 2-bases. Mathematica Scandinavica. 47: 177-180.
  • Kløve, Torleiv. 1980. Congruences for the partition function modulo powers of 5. Acta Arithmetica. 36: 219-227.
  • Kløve, Torleiv. 1979. On the no-three-in-line problem III. Journal of combinatorial theory. Series A (Print). 26: 82-83.
  • Kløve, Torleiv. 1979. On a conjecture of Bruckman. Mathematica Scandinavica. 44: 225-230.
  • Helleseth, Tor; Kløve, Torleiv; Mykkeltveit, Johannes. 1978. On the covering radius of binary codes. IEEE Transactions on Information Theory. 24: 627-628.
  • Kløve, Torleiv. 1978. On compliments of unary L languages. Journal of computer and system sciences (Print). 16: 56-66.
  • Kløve, Torleiv. 1978. Two non-closure results on families of L languages. BIT Numerical Mathematics. 18: 109-111.
  • Kløve, Torleiv. 1978. Noncovering of multiples. Mathematica Scandinavica. 43: 11-25.
  • Kløve, Torleiv. 1978. On the no-three-in-line problem II. Journal of combinatorial theory. Series A (Print). 24: 126-127.
  • Kløve, Torleiv. 1978. The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q). Discrete Mathematics. 23: 159-168.
  • Helleseth, Tor; Kløve, Torleiv; Mykkeltveit, Johannes. 1977. The weight distribution of irreducible cyclic codes with block lengths n_1((q^l-1)/N). Discrete Mathematics. 18: 179-211.
  • Kløve, Torleiv. 1977. Pumping languages. International Journal of Computer Mathematics. 6: 115-125.
  • Kløve, Torleiv. 1977. The weight distribution for a class of irreducible cyclic codes. Discrete Mathematics. 20: 87-90.
  • Kløve, Torleiv. 1977. The modular n-queen problem. Discrete Mathematics. 19: 289-291.
  • Kløve, Torleiv. 1976. A generalization of Euler's theorem. Portugaliae Mathematica. 35: 111-112.
  • Kløve, Torleiv. 1975. Representations of integers as sums of powers with increasing exponents II. BIT Numerical Mathematics. 15: 423-425.
  • Kløve, Torleiv. 1975. Sums of distinct elements from a fixed set. Mathematics of Computation. 29: 1144-1149.
  • Kløve, Torleiv. 1975. Sums of distinct Gaussian primes. Normat. 23: 20-22.
  • Kløve, Torleiv. 1975. A class of harmonically convergent sets. Journal of the Australian Mathematical Society. 20: 301-304.
  • Kløve, Torleiv. 1974. On exponential recurring sequences. Mathematica Scandinavica. 34: 44-50.
  • Kløve, Torleiv. 1974. Expressing a prime as a difference between two numbers containing all the previous primes. BIT Numerical Mathematics. 14: 40-44.
  • Kløve, Torleiv. 1973. Linear recurring sequences in Boolean rings. Mathematica Scandinavica. 33: 5-12.
  • Kløve, Torleiv. 1973. Periodicity of recurring sequences in rings. Mathematica Scandinavica. 32: 165-168.
  • Kløve, Torleiv. 1973. Sums of distinct primes. Normat. 21: 138-140.
  • Kløve, Torleiv. 1972. Representations of integers as sums of powers with increasing exponents. BIT Numerical Mathematics. 12: 342-346.
  • Kløve, Torleiv. 1971. Power sums of integers with missing digits. Mathematica Scandinavica. 28: 247-251.
  • Kløve, Torleiv. 1970. Density problems for p(n). Journal of the London Mathematical Society. 2: 504-508.
  • Kløve, Torleiv. 1970. Recurrence formulae for the coefficients of modular forms. Mathematica Scandinavica. 26: 221-232.
  • Hjelle, Truls; Kløve, Torleiv. 1968. Congruence properties and density problems for the Fourier coefficients of modular forms. Mathematica Scandinavica. 23: 160-166.
  • Kløve, Torleiv. 1968. Recurrence formulae for the coefficients of modular forms and congruences for the partition function and for the coefficients of j(τ), (j(τ)-1728)^1/2, and j(τ)^1/3. Mathematica Scandinavica. 23: 133-159.
Reports and theses
  • Kløve, Torleiv. 2009. The size of spheres of multipermutations under the maximum distance. Institutt for informatikk, Universitetet i Bergen, Bergen. 26 pages.
  • Kløve, Torleiv. 2009. Frequency permutation arrays within distance one. Institutt for informatikk, Universitetet i Bergen, Bergen. 17 pages.
  • Tveito, Aslak; Almås, Aslaug Grov; Goebel, Vera; Heggernes, Pinar; Ingebrigtsen, Kjell Arne; Johansen, Dag; Kløve, Torleiv; Opdahl, Andreas; Pettersen, Kristin Ytterstad; Aagesen, Finn Arve. 2004. Nyttig nysgjerrighet : Fagplan for informasjons- og kommunikasjonsteknologi (IKT). Norges Forskningsråd, Oslo. 31 pages.
  • Chen, Wende; Kløve, Torleiv. 2003. On the second greedy weight for linear codes of dimension at least 4. Reports in Informatics. 252. Institutt for informatikk, Univ. i Bergen, Bergen. 8 pages.
  • Ding, Cunsheng; Kløve, Torleiv; Golin, Mordecai. 2002. Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Theoretical Computer Science Center Research Reports. HKUST-TCSC-2002. Theoretical Computer Science Center, HKUST, Hong Kong.
  • Chen, Wende; Kløve, Torleiv. 2001. Weight hierarchies of linear codes satisfying the almost chain conditio. Reports in Informatics. 215. Institutt for informatikk, UiB, Bergen.
  • Kløve, Torleiv; Chen, Wende. 2000. Weight hierarchies of extremal non-chain ternary codes of dimension 4. Reports in Informatics. 196. Institutt for informatikk, Universitetet i Bergen, Bergen. 49 pages.
  • Chen, Wende; Kløve, Torleiv. 1998. Classification of the weight hierarchies of binary linear codes of dimension 4. Reports in Informatics. 147. Institutt for informatikk.
  • Gabidulin, Ernst; Kløve, Torleiv. 1997. On the Newton radius of codes. Reports in Informatics. 130. Institutt for informatikk, Univ. i Bergen.
  • Helleseth, Tor; Kløve, Torleiv. 1997. Abstracts, IEEE Information Theory Workshop, Longyearbyen, July 6-12, 1997. Reports in Informatics. 139. Institutt for Informatikk.
  • Chen, Wende; Kløve, Torleiv. 1996. Weight hierarchies of linear codes satisfying the chain condition. Reports in Informatics. 126. Institutt for Informatikk, UiB.
  • Chen, Wende; Kløve, Torleiv. 1996. Bounds on the weight hierarchies of linear codes of dimesion 4. Reports in Informatics. 125. Institutt for Informatikk, UiB.
  • Kløve, Torleiv; Chen, Wende. 1995. The weight hierarchies of @Sq@S-ary codes of dimension 4. Reports in Informatics. 111. Dept. of Informatics, UiB.
  • Chen, Weiqin; Kløve, Torleiv. 1993. Lower bounds on multiple distinct sums sets. Reports in Informatics. 82. Department of Informatics, University of Bergen.
  • Helleseth, Tor; Kløve, Torleiv; Ytrehus, Øyvind. 1993. On generalizations of the Grismer bound. Report in Informatics. 87. Department of Informatics, University of Bergen.
  • Encheva, S.; Kløve, Torleiv. 1992. Codes satisfying the chain condition. Report in Informatics. 70. [Mangler utgivernavn].
  • Helleseth, Tor; Kløve, Torleiv; Ytrehus, Øyvind. 1992. Excess sequences of codes and the chain condition. Report in Informatics. 65. [Mangler utgivernavn].
  • Kløve, Torleiv. 1990. K-sequences, a generalization of sonar sequences an B-sequences. [Mangler utgivernavn].
  • Kløve, Torleiv. 1986. Bounds on the size of optimal difference triangle sets. [Mangler utgivernavn].
  • Kløve, Torleiv. 1984. Codes for error correction and detection. [Mangler utgivernavn].
  • Kløve, Torleiv. 1984. Generalization of the korzhik bound. [Mangler utgivernavn].
  • Kløve, Torleiv. 1983. L codes on alphabets with two symbols. Reports in Informatics. 5. Matematisk institutt, Universitetet i Bergen.
  • Kløve, Torleiv. 1982. The minimal range of h-bases. Reports Published by the Department of Pure Mathematics. 21. UiB-MatNat: Matematisk institutt.
  • Kløve, Torleiv. 1981. Error correcting codes for the asymmetric channel. Reports Published by the Department of Pure Mathematics. 18. UiB-MatNat: Matematisk institutt.
  • Helleseth, Tor; Kløve, Torleiv; Mykkeltveit, J. 1975. Weight distribution of irreducible cyclic codes with block lengths n_1(q^l-1)/N, part II, some special classes and numerical results. Reports Published by the Department of Pure Mathematics. 6. UiB-MatNat: Matematisk institutt.
  • Helleseth, Tor; Kløve, Torleiv; Mykkeltveit, J. 1975. The weight distribution of irreducible cyclic codes with block lengths n_1(q^l-1)/N, part I, general theory. Reports Published by the Department of Pure Mathematics. 5. UiB-MatNat: Matematisk institutt.
  • Kløve, Torleiv. 1971. Recurrence formulae, congruences, and density problems for the coefficients of modular forms. UiB.
Book sections
  • Kløve, Torleiv; Schwartz, Moshe. 2013. Covering sets for limited-magnitude errors”. Kapittel, pages 69-78. In:
    • Budaghyan, Lilya; Helleseth, Tor; Parker, Matthew Geoffrey. 2013. Preproceedings, The International Workshop on Coding and Cryptography WCC 2013. Universitetet i Bergen. 576 pages. ISBN: 978-82-308-2269-2.
  • Baldi, Marco; Bianchi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco; Kløve, Torleiv. 2012. On the generator matrix of array LDPC codes. kapittel, pages . In:
    • Rozic, Nikola; Begusic, Dinko. 2012. The 20th International Conference on Software, Telecommunications and Computer Networks. IEEE conference proceedings. ISBN: 978-953-290-035-4.
  • Kløve, Torleiv. 2012. On some linear codes that are proper for error detection. Kapittel, pages 33-38. In:
    • Franceschetti, Massimo. 2012. Information Theory and Applications Workshop 2012. IEEE conference proceedings. 427 pages. ISBN: 978-1-4673-1473-2.
  • Kløve, Torleiv; Bose, Bella; Elarief, Noha. 2010. Systematic single limited magnitude asymmetric error correcting codes. Kapittel, pages 138-138. In:
    • El Gamal, Abbas. 2010. Proceedings, IEEE Information Theory Workshop, Giza, Egypt, January 6-8, 2010. IEEE conference proceedings. 469 pages. ISBN: 978-1-4244-6414-2.
  • Kløve, Torleiv; Yari, Somaye. 2010. Proper self-complementary codes. Kapitel, pages 118-122. In:
    • Lin, Mao-Chao; Ochiai, Hideki; Ikegami, Tetsushi. 2010. Proceedings of 2010 International Symposium on Information Theory and its Applications. 1063 pages. ISBN: 978-1-4244-6014-4.
  • Helleseth, Tor; Kløve, Torleiv. 2009. Algebraic Coding Theory. kapittel, pages 80-94. In:
    • Wah, Benjamin. 2009. Encyclopedia of Computer Science and Engineering. John Wiley & Sons. 3123 pages. ISBN: 978-0-471-38393-2.
  • Kløve, Torleiv. 2009. On the existence of proper codes for error detection. kapittel, pages 239-243. In:
    • Calderbank, Robert; Chung, Habong; Orlitsky, Alon. 2009. 2009 IEEE International Symposium on Information Theory. IEEE Press. 2896 pages. ISBN: 978-1-4244-4313-0.
  • Kløve, Torleiv. 2008. Distance-Preserving Mappings. Kapittel, pages 171-182. In:
    • Li, Yongqing; Zhang, Shengyuan; Ling, San; Wang, Huaxiong; Xing, Chaoping; Niederreiter, Harald. 2008. CODING AND CRYPTOLOGY, Proceedings of the International Workshop, Wuyi Mountain, Fujian, China 11 - 15 June 2007. World Scientific. 250 pages. ISBN: 978-981-283-223-8.
  • Chiaraluce, Franco; Baldi, Marco; Spinsante, Susanna; Kløve, Torleiv. 2007. The Probability of Undetected Error for Varshamov-Tenengol'ts Codes. kapittel, pages 1119-1124. In:
    • Thompson, John; Andonovic, Ivan. 2007. IEEE International Conference on Communication. IEEE Communications Society. 6545 pages. ISBN: 1-4244-0353-7.
  • Helleseth, Tor; Kløve, Torleiv; Levenshtein, Vladimir. 2006. A bound for codes with given minimum and maximum distance. Kapittel, pages 292-296. In:
    • O'Sullivan, Joseph A.; Anderson, John. 2006. IEEE 2006 International Symposium on Information Theory. IEEE Press. 2123 pages. ISBN: 1-4244-0504-1.
  • Naydenova, Irina; Kløve, Torleiv. 2006. A Bound on q-ary t-EC-AUED Codes and Constructions of Some Optimal Ternary t-EC-AUED Codes. Kapittel, pages 136-139. In:
    • Chung, Habong; Fujiwara, Toru. 2006. The 2006 International Symposium on Information Theory and its Applications. 937 pages. ISBN: 4-902087-19-7.
  • Naydenova, Irina; Kløve, Torleiv. 2006. Large proper codes for error detection. Kapittel, pages 170-174. In:
    • Li, Ping; Yeung, Raymond. 2006. Proceedings of 2006 IEEE Information Theory Workshop. IEEE Press. 722 pages. ISBN: 1-4244-0067-8.
  • Bose, Bella; Kløve, Torleiv. 2005. Sperner's theorem and unidirectional codes. Kapittel, pages 169-175. In:
    • Charpin, Pascale; Ytrehus, Øyvind. 2005. The International Workshop on Coding and Cryptography 2005: Book of Extended Abstracts. Department of Informatics, University of Bergen, Bergen. 500 pages.
  • Gancheva, Irina; Kløve, Torleiv. 2005. Codes for error detection, good or not good. kapittel, pages 2228-2231. In:
    • Schlegel, Christian; Hanley, Stephen. 2005. Proceedings 2005 International Symposium on Information Theory. IEEE Press. 491 pages. ISBN: 0-7803-9151-9.
  • Gancheva, Irina; Kløve, Torleiv. 2005. Constructions of some optimal t-EC-AUED codes. Kapittel, pages 152-156. In:
    • Dodunekov, Stefan. 2005. Proceedings Optimal Codes and Related Topics. 303 pages. ISBN: 954-8986-18-3.
  • Gancheva, Irina; Kløve, Torleiv. 2005. Generalized Bose-Lin codes, a class of codes detecting asymmetric errors. Kapittel, pages 157-162. In:
    • Dodunekov, Stefan. 2005. Proceedings Optimal Codes and Related Topics. 303 pages. ISBN: 954-8986-18-3.
  • Bose, Bella; Kløve, Torleiv. 2004. On two upper bounds on the size of t-EC-AUED codes. Abstract, pages 482-482. In:
    • Kschschang, Frank; Tse, David. 2004. Proceedings 2004 IEEE International Symposium on Information Theory. IEEE Computer Society. 565 pages. ISBN: 0-7803-8280-3.
  • Kløve, Torleiv; Bose, Bella; Oprisan, Paul. 2004. Probability of undetected error for a class of unidirectional error detecting codes. Abstract, pages 481-481. In:
    • Kschschang, Frank; Tse, David. 2004. Proceedings 2004 IEEE International Symposium on Information Theory. IEEE Computer Society. 565 pages. ISBN: 0-7803-8280-3.
  • Chen, Wende; Kløve, Torleiv. 2002. Weight hierarchies of linear codes satisfying the almost chain condition. Kapittel, pages 233-233. In:
    • Lapidoth, Amos; Telatar, Emre. 2002. Proceedings 2002 IEEE International Symposium on Information Theory. IEEE Press. 507 pages. ISBN: 0-7803-7501-7.
  • Helleseth, Tor; Kløve, Torleiv. 1999. Algebraic Coding Theory. 402-415. In:
    • [Mangler etternavn], [Mangler fornavn]. 1999. Wiley Encyclopedia of Electrical and Electroninc Engineering.

More information in national current research information system (CRIStin)

See list of publications here.