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