Search the dblp DataBase
Torleiv Kløve :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Wende Chen , Torleiv Kløve On the Second Greedy Weight for Binary Linear Codes. [Citation Graph (0, 0)][DBLP ] AAECC, 1999, pp:131-141 [Conf ] Tor Helleseth , Torleiv Kløve , Øyvind Ytrehus Generalizations of the Griesmer Bound. [Citation Graph (0, 0)][DBLP ] Error Control, Cryptology, and Speech Compression, 1993, pp:41-52 [Conf ] Torleiv Kløve Binary Linear Codes That Are Optimal for Error Correction. [Citation Graph (0, 0)][DBLP ] GTIT-C, 2006, pp:1081-1083 [Conf ] Wende Chen , Torleiv Kløve Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:379-386 [Journal ] Cunsheng Ding , Torleiv Kløve , Francesco Sica Two classes of ternary codes and their weight distributions. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:111, n:1-2, pp:37-53 [Journal ] Fang-Wei Fu , Torleiv Kløve , Yuan Luo , Victor K. Wei On Equidistant Constant Weight Codes. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:128, n:1, pp:157-164 [Journal ] Ross J. Anderson , Cunsheng Ding , Tor Helleseth , Torleiv Kløve How to Build Robust Shared Control Systems. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1998, v:15, n:2, pp:111-124 [Journal ] Wende Chen , Zhi Chen , Torleiv Kløve New Constructions of Disjoint Distinct Difference Sets. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1998, v:15, n:2, pp:157-165 [Journal ] Wende Chen , Torleiv Kløve Weight Hierarchies of Linear Codes Satisfying the Chain Condition. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1998, v:15, n:1, pp:47-66 [Journal ] Cunsheng Ding , Mordecai J. Golin , Torleiv Kløve Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2003, v:30, n:1, pp:73-84 [Journal ] Tor Helleseth , Torleiv Kløve , Vladimir I. Levenshtein Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2003, v:28, n:3, pp:265-282 [Journal ] Wende Chen , Torleiv Kløve On the second greedy weight for linear codes of dimension 3. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:241, n:1-3, pp:171-187 [Journal ] Wende Chen , Torleiv Kløve Weight hierarchies of binary linear codes of dimension 4. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:238, n:1-3, pp:27-34 [Journal ] Torleiv Kløve Relations between the covering and Newton radii of binary codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:238, n:1-3, pp:81-88 [Journal ] Tor Helleseth , Torleiv Kløve On Group-Theoretic Codes for Assymmetric Channels [Citation Graph (0, 0)][DBLP ] Information and Control, 1981, v:49, n:1, pp:1-9 [Journal ] Torleiv Kløve On Complements of Unary L Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1978, v:16, n:1, pp:56-66 [Journal ] Torleiv Kløve On the No-Three-in-Line Problem, II. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1978, v:24, n:1, pp:126-127 [Journal ] Torleiv Kløve On the No-Three-in-Line Problem, III. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1979, v:26, n:1, pp:82-83 [Journal ] Fang-Wei Fu , Torleiv Kløve Two constructions of permutation arrays. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:881-883 [Journal ] Jen-Chun Chang , Rong-Jaye Chen , Torleiv Kløve , Shi-Chun Tsai Distance-preserving mappings from binary vectors to permutations. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:1054-1059 [Journal ] Wende Chen , Torleiv Kløve On the second greedy weight for linear codes of dimension at least 4. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:354-356 [Journal ] Wende Chen , Torleiv Kløve The weight hierarchies of q -ary codes of dimension 4. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2265-2272 [Journal ] Wende Chen , Torleiv Kløve Bounds on the weight hierarchies of linear codes of dimension 4. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2047-2054 [Journal ] Wende Chen , Torleiv Kløve Weight Hierarchies of Extremal Non-Chain Binary Codes of Dimension 4. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:276-281 [Journal ] Charles J. Colbourn , Torleiv Kløve , Alan C. H. Ling Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1289-1291 [Journal ] Cunsheng Ding , Fang-Wei Fu , Torleiv Kløve , Victor K.-W. Wei Constructions of permutation arrays. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:977-980 [Journal ] Rossitza Dodunekova , Stefan M. Dodunekov , Torleiv Kløve Almost-MDS and near-MDS codes for error detection. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:285-289 [Journal ] Sylvia B. Encheva , Torleiv Kløve Codes satisfying the chain condition. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:175-0 [Journal ] Fang-Wei Fu , Torleiv Kløve , Yuan Luo , Victor K. Wei On the Svanström bound for ternary constant-weight codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2061-2064 [Journal ] Fang-Wei Fu , Torleiv Kløve , Shi-Yi Shen On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:803-807 [Journal ] Fang-Wei Fu , Torleiv Kløve , Victor K.-W. Wei On the undetected error probability for binary codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:382-390 [Journal ] Fang-Wei Fu , Torleiv Kløve , Shu-Tao Xia The undetected error probability threshold of m-out-of-n codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1597-1599 [Journal ] Ernst M. Gabidulin , Torleiv Kløve On the Newton and covering radii of linear codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2534-2536 [Journal ] Tor Helleseth , Torleiv Kløve The number of cross-join pairs in maximum length linear sequences. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1731-0 [Journal ] Tor Helleseth , Torleiv Kløve The weight hierarchies of some product codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:1029-1034 [Journal ] Tor Helleseth , Torleiv Kløve The Newton radius of codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:1820-1831 [Journal ] Tor Helleseth , Torleiv Kløve , Vladimir I. Levenshtein The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2818-2823 [Journal ] Tor Helleseth , Torleiv Kløve , Vladimir I. Levenshtein Error-correction capability of binary linear codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1408-1423 [Journal ] Tor Helleseth , Torleiv Kløve , Vladimir I. Levenshtein On the information function of an error-correcting code. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:549-557 [Journal ] Tor Helleseth , Torleiv Kløve , Vladimir I. Levenshtein , Øyvind Ytrehus Bounds on the minimum support weights. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:432-440 [Journal ] Tor Helleseth , Torleiv Kløve , Øyvind Ytrehus Generalized Hamming weights of linear codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1133-0 [Journal ] Tadao Kasami , Torleiv Kløve , Shu Lin Linear block codes for error detection. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:131-0 [Journal ] Torleiv Kløve Upper bounds on codes correcting asymmetric errors. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1981, v:27, n:1, pp:128-0 [Journal ] Torleiv Kløve A lower bound for A(n, 4, w). [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1981, v:27, n:2, pp:257-0 [Journal ] Torleiv Kløve On Robinson's coding problem. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:450-0 [Journal ] Torleiv Kløve Generalizations of the Korzhik bound. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:771-0 [Journal ] Torleiv Kløve Using codes for error correction and detection. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:6, pp:868-0 [Journal ] Torleiv Kløve The probability of undetected error when a code is used for error correction and detection. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:388-0 [Journal ] Torleiv Kløve Bounds on the size of optimal difference triangle sets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:355-0 [Journal ] Torleiv Kløve Bounds and construction for difference triangle sets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:879-886 [Journal ] Torleiv Kløve Bounds and constructions of disjoint sets of distinct difference sets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:184-0 [Journal ] Torleiv Kløve Optimal codes for error detection. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:479-0 [Journal ] Torleiv Kløve Minimum support weights of binary codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:648-0 [Journal ] Torleiv Kløve The weight distribution of cosets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:911-0 [Journal ] Torleiv Kløve Codes correcting a single insertion/deletion of a zero or a single peak-shift. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:279-283 [Journal ] Torleiv Kløve Bounds on the worst case probability of undetected error. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:298-300 [Journal ] Torleiv Kløve The worst case probability of undetected error for linear codes on the local binomial channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:172-179 [Journal ] Torleiv Kløve Reed-Muller codes for error detection: the good, the bad, and the ugly. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1615-1622 [Journal ] Torleiv Kløve Bounds on the weight distribution of cosets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2257-2260 [Journal ] Torleiv Kløve , Paul Oprisan , Bella Bose Diversity combining for the Z-channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1174-1178 [Journal ] Torleiv Kløve , Paul Oprisan , Bella Bose The probability of undetected error for a class of asymmetric error detecting codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1202-1205 [Journal ] Irina Naydenova , Torleiv Kløve Generalized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:3, pp:1188-1193 [Journal ] Cunsheng Ding , Tor Helleseth , Torleiv Kløve , X. Wang A Generic Construction of Cartesian Authentication Codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2229-2235 [Journal ] Jyh-Shyan Lin , Jen-Chun Chang , Rong-Jaye Chen , Torleiv Kløve Distance preserving mappings from ternary vectors to permutations [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Torleiv Kløve The modular n-queen problem II. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1981, v:36, n:1, pp:33-48 [Journal ] Torleiv Kløve On codes satisfying the double chain condition. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:175, n:1-3, pp:173-195 [Journal ] Wende Chen , Torleiv Kløve Disjoint sets of distinct sum sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:175, n:1-3, pp:69-77 [Journal ] Wende Chen , Torleiv Kløve Lower bounds on multiple difference sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:98, n:1, pp:9-21 [Journal ] Torleiv Kløve Support weight distribution of linear codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:106, n:, pp:311-316 [Journal ] Wende Chen , Torleiv Kløve Lower bounds on multiple distinct sums sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:148, n:1-3, pp:15-35 [Journal ] The Probability of Undetected Error for Varshamov-Tenengol'ts Codes. [Citation Graph (, )][DBLP ] Codes for error detection, good or not good [Citation Graph (, )][DBLP ] Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes [Citation Graph (, )][DBLP ] Permutation Arrays Under the Chebyshev Distance [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.652secs