default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTorleiv Kløve
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j93]Torleiv Kløve
:
Codes of length two correcting single errors of limited size. Cryptogr. Commun. 11(3): 549-555 (2019)- 2018
- [c17]Torleiv Kløve:
Codes of Length Two Correcting Single Errors of Limited Size II. WAIFI 2018: 242-249 - 2017
- [c16]Massimo Battaglioni, Franco Chiaraluce, Torleiv Kløve:
On Non-Linear Codes Correcting Errors of Limited Size. GLOBECOM 2017: 1-7 - 2016
- [j92]Torleiv Kløve:
On covering sets for limited-magnitude errors. Cryptogr. Commun. 8(3): 415-433 (2016) - [j91]Torleiv Kløve:
Two Constructions of Covering Sets for Limited-Magnitude Errors. IEEE Trans. Inf. Theory 62(3): 1177-1182 (2016) - 2015
- [c15]Torleiv Kløve:
Codes of Length 2 Correcting Single Errors of Limited Size. IMACC 2015: 190-201 - 2014
- [j90]Torleiv Kløve, Moshe Schwartz:
Linear covering codes and error-correcting codes for limited-magnitude errors. Des. Codes Cryptogr. 73(2): 329-354 (2014) - [j89]Torleiv Kløve, Moshe Schwartz:
Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors. Des. Codes Cryptogr. 73(3): 1029 (2014) - 2013
- [j88]Somaye Yari, Torleiv Kløve, Bella Bose:
Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories. IEEE Trans. Inf. Theory 59(11): 7278-7287 (2013) - 2012
- [j87]Torleiv Kløve, Jinquan Luo, Somaye Yari:
Codes Correcting Single Errors of Limited Magnitude. IEEE Trans. Inf. Theory 58(4): 2206-2219 (2012) - [j86]Marco Baldi, Marco Bianchi, Franco Chiaraluce, Torleiv Kløve:
A Class of Punctured Simplex Codes Which Are Proper for Error Detection. IEEE Trans. Inf. Theory 58(6): 3861-3880 (2012) - [j85]Torleiv Kløve, Jinquan Luo:
Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes. IEEE Trans. Inf. Theory 58(8): 5512-5521 (2012) - [c14]Torleiv Kløve:
On some linear codes that are proper for error detection. ITA 2012: 33-38 - [c13]Marco Baldi, Marco Bianchi, Giovanni Cancellieri, Franco Chiaraluce, Torleiv Kløve:
On the generator matrix of array LDPC codes. SoftCOM 2012: 1-5 - 2011
- [j84]Torleiv Kløve:
Lower bounds on the size of spheres of permutations under the Chebychev distance. Des. Codes Cryptogr. 59(1-3): 183-191 (2011) - [j83]Torleiv Kløve, Bella Bose, Noha Elarief:
Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories. IEEE Trans. Inf. Theory 57(7): 4477-4487 (2011) - [j82]Torleiv Kløve, Jinquan Luo, Irina Naydenova, Somaye Yari:
Some Codes Correcting Asymmetric Errors of Limited Magnitude. IEEE Trans. Inf. Theory 57(11): 7459-7472 (2011) - [i6]Torleiv Kløve, Jinquan Luo:
The best possible upper bound on the probability of undetected error for linear codes of full support. CoRR abs/1102.2350 (2011) - [i5]Marco Baldi, Marco Bianchi, Franco Chiaraluce, Torleiv Kløve:
A class of punctured simplex codes which are proper for error detection. CoRR abs/1111.5484 (2011) - 2010
- [j81]Irina Naydenova, Torleiv Kløve:
Some necessary conditions for codes to be good for error detection. IEEE Trans. Inf. Theory 56(3): 1023-1027 (2010) - [j80]Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng:
Permutation arrays under the Chebyshev distance. IEEE Trans. Inf. Theory 56(6): 2611-2617 (2010) - [c12]Torleiv Kløve, Somaye Yari:
Proper self-complementary codes. ISITA 2010: 118-122
2000 – 2009
- 2009
- [j79]Torleiv Kløve:
Generating Functions for the Number of Permutations with Limited Displacement. Electron. J. Comb. 16(1) (2009) - [j78]Torleiv Kløve:
Constructing proper codes for error detection. IEEE Trans. Inf. Theory 55(8): 3520-3525 (2009) - [j77]Irina Naydenova, Torleiv Kløve:
Some optimal binary and ternary t-EC-AUED codes. IEEE Trans. Inf. Theory 55(11): 4898-4904 (2009) - [c11]Torleiv Kløve:
On the existence of proper codes for error detection. ISIT 2009: 239-243 - [i4]Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng:
Permutation Arrays Under the Chebyshev Distance. CoRR abs/0907.2682 (2009) - 2008
- [j76]Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve:
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations. IEEE Trans. Inf. Theory 54(3): 1334-1339 (2008) - [j75]Marco Baldi, Franco Chiaraluce, Torleiv Kløve:
Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov-Tenengol'ts Codes. IEEE Trans. Inf. Theory 54(11): 5019-5029 (2008) - [p1]Tor Helleseth, Torleiv Kløve:
Algebraic Coding Theory. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [b2]Torleiv Kløve:
Codes for Error Detection. Series on Coding Theory and Cryptology 2, WorldScientific 2007, ISBN 978-981-270-586-0, pp. 1-216 - [j74]Irina Naydenova, Torleiv Kløve:
Generalized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors. IEEE Trans. Inf. Theory 53(3): 1188-1193 (2007) - [j73]Cunsheng Ding, Tor Helleseth, Torleiv Kløve, X. Wang:
A Generic Construction of Cartesian Authentication Codes. IEEE Trans. Inf. Theory 53(6): 2229-2235 (2007) - [c10]Franco Chiaraluce, Marco Baldi, Susanna Spinsante, Torleiv Kløve:
The Probability of Undetected Error for Varshamov-Tenengol'ts Codes. ICC 2007: 1119-1124 - [i3]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) - [i2]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) - 2006
- [c9]Torleiv Kløve:
Binary Linear Codes That Are Optimal for Error Correction. GTIT-C 2006: 1081-1083 - [c8]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
A bound for codes with given minimum and maximum distances. ISIT 2006: 292-296 - 2005
- [j72]Torleiv Kløve, Paul Oprisan, Bella Bose:
Diversity combining for the Z-channel. IEEE Trans. Inf. Theory 51(3): 1174-1178 (2005) - [j71]Torleiv Kløve, Paul Oprisan, Bella Bose:
The probability of undetected error for a class of asymmetric error detecting codes. IEEE Trans. Inf. Theory 51(3): 1202-1205 (2005) - [j70]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
Error-correction capability of binary linear codes. IEEE Trans. Inf. Theory 51(4): 1408-1423 (2005) - [c7]Irina Gancheva, Torleiv Kløve:
Codes for error detection, good or not good. ISIT 2005: 2228-2231 - [i1]Irina Naydenova, Torleiv Kløve:
Codes for error detection, good or not good. CoRR abs/cs/0508035 (2005) - 2004
- [j69]Wende Chen, Torleiv Kløve:
On the second greedy weight for linear codes of dimension at least 4. IEEE Trans. Inf. Theory 50(2): 354-356 (2004) - [j68]Fang-Wei Fu, Torleiv Kløve:
Two constructions of permutation arrays. IEEE Trans. Inf. Theory 50(5): 881-883 (2004) - [j67]Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling:
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. IEEE Trans. Inf. Theory 50(6): 1289-1291 (2004) - [j66]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. IEEE Trans. Inf. Theory 50(11): 2818-2823 (2004) - [c6]Torleiv Kløve, Paul Oprisan, Bella Bose:
Probability of undetected error for a class of unidirectional error detecting codes. ISIT 2004: 481 - [c5]Bella Bose, Torleiv Kløve:
On two upper bounds on the size of t-EC-AUED codes. ISIT 2004: 482 - 2003
- [j65]Wende Chen, Torleiv Kløve:
Weight hierarchies of linear codes satisfying the almost chain condition. Sci. China Ser. F Inf. Sci. 46(3): 175-186 (2003) - [j64]Fang-Wei Fu, Torleiv Kløve, Luo Yuan, Victor K. Wei:
On Equidistant Constant Weight Codes. Discret. Appl. Math. 128(1): 157-164 (2003) - [j63]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. Des. Codes Cryptogr. 28(3): 265-282 (2003) - [j62]Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve:
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Des. Codes Cryptogr. 30(1): 73-84 (2003) - [j61]Fang-Wei Fu, Torleiv Kløve, Victor K.-W. Wei:
On the undetected error probability for binary codes. IEEE Trans. Inf. Theory 49(2): 382-390 (2003) - [j60]Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve, Shi-Chun Tsai:
Distance-preserving mappings from binary vectors to permutations. IEEE Trans. Inf. Theory 49(4): 1054-1059 (2003) - [c4]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
A coset weight count that proves that the simplex codes are not optimal for error correction. ITW 2003: 234-237 - 2002
- [j59]Cunsheng Ding, Fang-Wei Fu, Torleiv Kløve, Victor K.-W. Wei:
Constructions of permutation arrays. IEEE Trans. Inf. Theory 48(4): 977-980 (2002) - [c3]Fang-Wei Fu, Torleiv Kløve:
The complement of binary linear codes for error detection. ITW 2002 - 2001
- [j58]Cunsheng Ding, Torleiv Kløve, Francesco Sica:
Two classes of ternary codes and their weight distributions. Discret. Appl. Math. 111(1-2): 37-53 (2001) - [j57]Wende Chen, Torleiv Kløve:
Weight hierarchies of binary linear codes of dimension 4. Discret. Math. 238(1-3): 27-34 (2001) - [j56]Torleiv Kløve:
Relations between the covering and Newton radii of binary codes. Discret. Math. 238(1-3): 81-88 (2001) - [j55]Wende Chen, Torleiv Kløve:
On the second greedy weight for linear codes of dimension 3. Discret. Math. 241(1-3): 171-187 (2001) - [j54]Fang-Wei Fu, Torleiv Kløve, Yuan Luo, Victor K. Wei:
On Equidistant Constant Weight Codes. Electron. Notes Discret. Math. 6: 187-194 (2001) - [j53]Fang-Wei Fu, Torleiv Kløve, Luo Yuan, Victor K. Wei:
On the Svanström bound for ternary constant-weight codes. IEEE Trans. Inf. Theory 47(5): 2061-2064 (2001) - 2000
- [j52]Fang-Wei Fu, Torleiv Kløve, Shu-Tao Xia:
The undetected error probability threshold of m-out-of-n codes. IEEE Trans. Inf. Theory 46(4): 1597-1599 (2000)
1990 – 1999
- 1999
- [j51]Wende Chen, Torleiv Kløve:
Weight Hierarchies of Extremal Non-Chain Binary Codes of Dimension 4. IEEE Trans. Inf. Theory 45(1): 276-281 (1999) - [j50]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 Trans. Inf. Theory 45(2): 803-807 (1999) - [j49]Ernst M. Gabidulin, Torleiv Kløve:
On the Newton and covering radii of linear codes. IEEE Trans. Inf. Theory 45(7): 2534-2536 (1999) - [c2]Wende Chen, Torleiv Kløve:
On the Second Greedy Weight for Binary Linear Codes. AAECC 1999: 131-141 - 1998
- [j48]Wende Chen, Torleiv Kløve:
Weight Hierarchies of Linear Codes Satisfying the Chain Condition. Des. Codes Cryptogr. 15(1): 47-66 (1998) - [j47]Ross J. Anderson, Cunsheng Ding, Tor Helleseth, Torleiv Kløve:
How to Build Robust Shared Control Systems. Des. Codes Cryptogr. 15(2): 111-124 (1998) - [j46]Wende Chen, Zhi Chen, Torleiv Kløve:
New Constructions of Disjoint Distinct Difference Sets. Des. Codes Cryptogr. 15(2): 157-165 (1998) - 1997
- [j45]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) - [j44]Wende Chen, Torleiv Kløve:
Disjoint sets of distinct sum sets. Discret. Math. 175(1-3): 69-77 (1997) - [j43]Torleiv Kløve:
On codes satisfying the double chain condition. Discret. Math. 175(1-3): 173-195 (1997) - [j42]Rossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve:
Almost-MDS and near-MDS codes for error detection. IEEE Trans. Inf. Theory 43(1): 285-289 (1997) - [j41]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
On the information function of an error-correcting code. IEEE Trans. Inf. Theory 43(2): 549-557 (1997) - [j40]Tor Helleseth, Torleiv Kløve:
The Newton radius of codes. IEEE Trans. Inf. Theory 43(6): 1820-1831 (1997) - [j39]Wende Chen, Torleiv Kløve:
Bounds on the weight hierarchies of linear codes of dimension 4. IEEE Trans. Inf. Theory 43(6): 2047-2054 (1997) - 1996
- [j38]Wende Chen, Torleiv Kløve:
Lower bounds on multiple distinct sums sets. Discret. Math. 148(1-3): 15-35 (1996) - [j37]Torleiv Kløve:
The worst case probability of undetected error for linear codes on the local binomial channel. IEEE Trans. Inf. Theory 42(1): 172-179 (1996) - [j36]Tor Helleseth, Torleiv Kløve:
The weight hierarchies of some product codes. IEEE Trans. Inf. Theory 42(3): 1029-1034 (1996) - [j35]Torleiv Kløve:
Reed-Muller codes for error detection: the good, the bad, and the ugly. IEEE Trans. Inf. Theory 42(5): 1615-1622 (1996) - [j34]Torleiv Kløve:
Bounds on the weight distribution of cosets. IEEE Trans. Inf. Theory 42(6): 2257-2260 (1996) - [j33]Wende Chen, Torleiv Kløve:
The weight hierarchies of q -ary codes of dimension 4. IEEE Trans. Inf. Theory 42(6): 2265-2272 (1996) - 1995
- [b1]Torleiv Kløve, Valery I. Korzhik:
Error detecting codes - general theory and their application in feedback communication systems. The Kluwer international series in engineering and computer science 335, Kluwer 1995, ISBN 978-0-7923-9629-1, pp. I-XIII, 1-249 - [j32]Torleiv Kløve:
Codes correcting a single insertion/deletion of a zero or a single peak-shift. IEEE Trans. Inf. Theory 41(1): 279-283 (1995) - [j31]Torleiv Kløve:
Bounds on the worst case probability of undetected error. IEEE Trans. Inf. Theory 41(1): 298-300 (1995) - [j30]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus:
Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2): 432-440 (1995) - 1994
- [j29]Sylvia B. Encheva, Torleiv Kløve:
Codes satisfying the chain condition. IEEE Trans. Inf. Theory 40(1): 175-180 (1994) - [j28]Torleiv Kløve:
The weight distribution of cosets. IEEE Trans. Inf. Theory 40(3): 911-913 (1994) - 1993
- [j27]Torleiv Kløve:
Minimum support weights of binary codes. IEEE Trans. Inf. Theory 39(2): 648-654 (1993) - [c1]Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus:
Generalizations of the Griesmer Bound. Error Control, Cryptology, and Speech Compression 1993: 41-52 - 1992
- [j26]Torleiv Kløve:
Support weight distribution of linear codes. Discret. Math. 106-107: 311-316 (1992) - [j25]Torleiv Kløve:
Optimal codes for error detection. IEEE Trans. Inf. Theory 38(2): 479-489 (1992) - [j24]Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus:
Generalized Hamming weights of linear codes. IEEE Trans. Inf. Theory 38(3): 1133-1140 (1992) - 1991
- [j23]Wende Chen, Torleiv Kløve:
Lower bounds on multiple difference sets. Discret. Math. 98(1): 9-21 (1991) - [j22]Tor Helleseth, Torleiv Kløve:
The number of cross-join pairs in maximum length linear sequences. IEEE Trans. Inf. Theory 37(6): 1731-1733 (1991) - 1990
- [j21]Torleiv Kløve:
Bounds and constructions of disjoint sets of distinct difference sets. IEEE Trans. Inf. Theory 36(1): 184-190 (1990)
1980 – 1989
- 1989
- [j20]Torleiv Kløve:
Bounds and construction for difference triangle sets. IEEE Trans. Inf. Theory 35(4): 879-886 (1989) - 1988
- [j19]Torleiv Kløve:
Bounds on the size of optimal difference triangle sets. IEEE Trans. Inf. Theory 34(2): 355-361 (1988) - 1984
- [j18]Torleiv Kløve, Michael Miller:
The Detection of Errors After Error-Correction Decoding. IEEE Trans. Commun. 32(5): 511-517 (1984) - [j17]Torleiv Kløve:
The probability of undetected error when a code is used for error correction and detection. IEEE Trans. Inf. Theory 30(2): 388-392 (1984) - [j16]Torleiv Kløve:
Generalizations of the Korzhik bound. IEEE Trans. Inf. Theory 30(5): 771-773 (1984) - [j15]Torleiv Kløve:
Using codes for error correction and detection. IEEE Trans. Inf. Theory 30(6): 868-870 (1984) - 1983
- [j14]Tadao Kasami, Torleiv Kløve, Shu Lin:
Linear block codes for error detection. IEEE Trans. Inf. Theory 29(1): 131-136 (1983) - [j13]Torleiv Kløve:
On Robinson's coding problem. IEEE Trans. Inf. Theory 29(3): 450- (1983) - 1981
- [j12]Torleiv Kløve:
The modular n-queen problem II. Discret. Math. 36(1): 33-48 (1981) - [j11]Tor Helleseth, Torleiv Kløve:
On Group-Theoretic Codes for Assymmetric Channels. Inf. Control. 49(1): 1-9 (1981) - [j10]Torleiv Kløve:
Upper bounds on codes correcting asymmetric errors. IEEE Trans. Inf. Theory 27(1): 128-131 (1981) - [j9]Torleiv Kløve:
A lower bound for A(n, 4, w). IEEE Trans. Inf. Theory 27(2): 257- (1981)
1970 – 1979
- 1979
- [j8]Torleiv Kløve:
On the No-Three-in-Line Problem, III. J. Comb. Theory A 26(1): 82-83 (1979) - 1978
- [j7]Torleiv Kløve:
The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>). Discret. Math. 23(2): 159-168 (1978) - [j6]Torleiv Kløve:
On Complements of Unary L Languages. J. Comput. Syst. Sci. 16(1): 56-66 (1978) - [j5]Torleiv Kløve:
On the No-Three-in-Line Problem, II. J. Comb. Theory A 24(1): 126-127 (1978) - [j4]Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit:
On the covering radius of binary codes (Corresp.). IEEE Trans. Inf. Theory 24(5): 627-628 (1978) - 1977
- [j3]Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit:
The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N). Discret. Math. 18(2): 179-211 (1977) - [j2]Torleiv Kløve:
The modular n-queen problem. Discret. Math. 19(3): 289-291 (1977) - [j1]Torleiv Kløve:
The weight distribution for a class of irreducible cyclic codes. Discret. Math. 20: 87-90 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
