Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Torleiv Kløve - MaRDI portal

Torleiv Kløve

From MaRDI portal
(Redirected from Person:866018)
Person:182048

Available identifiers

zbMath Open klove.torleivMaRDI QIDQ182048

List of research outcomes





PublicationDate of PublicationType
Codes of length two correcting single errors of limited size2019-05-15Paper
Codes of length two correcting single errors of limited size. II2019-02-15Paper
Generalizations of the Griesmer bound2018-04-26Paper
Some Optimal Binary and Ternary $t$-EC-AUED Codes2017-08-08Paper
Constructing Proper Codes for Error Detection2017-08-08Paper
Permutation Arrays Under the Chebyshev Distance2017-07-27Paper
Some Necessary Conditions for Codes to Be Good for Error Detection2017-07-27Paper
Codes Correcting Single Errors of Limited Magnitude2017-07-12Paper
Some Codes Correcting Asymmetric Errors of Limited Magnitude2017-07-12Paper
Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories2017-07-12Paper
Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories2017-06-08Paper
Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes2017-06-08Paper
Two Constructions of Covering Sets for Limited-Magnitude Errors2017-04-28Paper
On covering sets for limited-magnitude errors2016-05-04Paper
Codes of Length 2 Correcting Single Errors of Limited Size2016-01-12Paper
Linear covering codes and error-correcting codes for limited-magnitude errors2014-08-18Paper
Lower bounds on the size of spheres of permutations under the Chebychev distance2011-04-08Paper
Generating functions for the number of permutations with limited displacement2010-03-26Paper
Distance-Preserving Mappings2009-03-09Paper
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations2009-02-24Paper
Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes2009-02-24Paper
Binary Linear Codes That Are Optimal for Error Correction2009-01-22Paper
Two Constructions of Permutation Arrays2008-12-21Paper
On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<2008-12-21Paper
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares2008-12-21Paper
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction2008-12-21Paper
Error-Correction Capability of Binary Linear Codes2008-12-21Paper
Diversity Combining for the Z-Channel2008-12-21Paper
The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes2008-12-21Paper
Generalized Bose–Lin Codes, a Class of Codes Detecting Asymmetric Errors2008-12-21Paper
A Generic Construction of Cartesian Authentication Codes2008-12-21Paper
https://portal.mardi4nfdi.de/entity/Q34457822007-06-06Paper
Weight hierarchies of linear codes satisfying the almost chain condition2007-02-20Paper
On the second greedy weight for linear codes satisfying the fullrank condition2006-01-13Paper
Distance-preserving mappings from binary vectors to permutations2005-06-01Paper
On the undetected error probability for binary codes2005-05-31Paper
Constructions of permutation arrays2005-05-11Paper
Finite projective geometries and classification of the weight hierarchies of codes. I2004-11-25Paper
Weight hierarchies of linear codes of dimension 32003-09-08Paper
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets2003-09-07Paper
Two classes of ternary codes and their weight distributions2003-08-26Paper
Hypercubic 4 and 5-designs from double-error-correcting BCH codes2003-07-01Paper
On equidistant constant weight codes2003-06-10Paper
On the second greedy weight for linear codes of dimension 32002-10-08Paper
On the Svanstrom bound for ternary constant-weight codes2002-08-04Paper
Relations between the covering and Newton radii of binary codes2002-03-06Paper
Diffuse difference triangle sets2002-02-21Paper
https://portal.mardi4nfdi.de/entity/Q27414092001-10-14Paper
Weight hierarchies of binary linear codes of dimension 42001-09-19Paper
https://portal.mardi4nfdi.de/entity/Q45026202000-09-12Paper
On the Newton and covering radii of linear codes2000-09-07Paper
The undetected error probability threshold of m-out-of-n codes2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q44858622000-06-20Paper
Weight hierarchies of extremal non-chain binary codes of dimension 41999-11-21Paper
On the Hamming distance between two i.i.d. random n-tuples over a finite set1999-11-21Paper
How to build robust shared control systems1999-08-26Paper
Weight hierarchies of linear codes satisfying the chain condition1999-05-31Paper
New construction of disjoint distinct difference sets1999-05-09Paper
https://portal.mardi4nfdi.de/entity/Q38387491999-03-22Paper
The Newton radius of codes1999-01-14Paper
Bounds on the weight hierarchies of linear codes of dimension 41998-11-17Paper
Disjoint sets of distinct sum sets1998-03-08Paper
On codes satisfying the double chain condition1998-01-26Paper
Bounds on the weight hierarchies of extremal non-chain codes of dimension 41997-12-04Paper
Almost-MDS and near-MDS codes for error detection1997-11-16Paper
Bounds on the weight distribution of cosets1997-10-09Paper
On generalization of sonar sequences and intermodulation-free frequencies assignment sequences1997-07-13Paper
On the information function of an error-correcting code1997-06-10Paper
The weight hierarchies of q-ary codes of dimension 41997-05-12Paper
https://portal.mardi4nfdi.de/entity/Q31288141997-04-20Paper
The weight hierarchies of some product codes1997-04-09Paper
The worst case probability of undetected error for linear codes on the local binomial channel1996-11-24Paper
Reed-Muller codes for error detection: the good, the bad, and the ugly1996-10-22Paper
Lower bounds on multiple distinct sum sets1996-03-24Paper
Codes correcting a single insertion/deletion of a zero or a single peak-shift1995-09-17Paper
Bounds on the worst case probability of undetected error1995-08-01Paper
Bounds on the minimum support weights1995-07-12Paper
The weight distribution of cosets1995-07-12Paper
Codes satisfying the chain condition1994-10-04Paper
Minimum support weights of binary codes1993-09-16Paper
Support weight distribution of linear codes1993-01-16Paper
Generalized Hamming weights of linear codes1992-09-27Paper
Lower bounds on multiple difference sets1992-06-28Paper
The number of cross-join pairs in maximum length linear sequences1992-06-28Paper
Optimal codes for error detection1992-06-28Paper
Constructions of $B_{h}[g$-sequences]1992-06-25Paper
Bounds and constructions of disjoint sets of distinct difference sets1990-01-01Paper
Bounds and construction for difference triangle sets1989-01-01Paper
Bounds on the size of optimal difference triangle sets1988-01-01Paper
Using codes for error correction and detection (Corresp.)1984-01-01Paper
The probability of undetected error when a code is used for error correction and detection (Corresp.)1984-01-01Paper
Generalizations of the Korzhik bound (Corresp.)1984-01-01Paper
On Robinson's coding problem (Corresp.)1983-01-01Paper
The minimal range of additive $h$-bases.1983-01-01Paper
Linear block codes for error detection (Corresp.)1983-01-01Paper
The modular n-queen problem. II1981-01-01Paper
Upper bounds on codes correcting asymmetric errors (Corresp.)1981-01-01Paper
A lower bound for<tex>A(n,4,w)</tex>(Corresp.)1981-01-01Paper
On group-theoretic codes for asymmetric channels1981-01-01Paper
A class of symmetric 2-bases.1980-01-01Paper
Congruences for the partition function modulo powers of 51980-01-01Paper
On the no-three-in-line problem. III1979-01-01Paper
On a conjecture of Bruckman.1979-01-01Paper
The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)1978-01-01Paper
On complements of unary L languages1978-01-01Paper
The weight distribution for a class of irreducible cyclic codes1978-01-01Paper
The modular n-queen problem1978-01-01Paper
On the no-three-in-line problem. II1978-01-01Paper
On the covering radius of binary codes (Corresp.)1978-01-01Paper
Two non-closure results on families ofL languages1978-01-01Paper
Noncovering of multiples.1978-01-01Paper
The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)1977-01-01Paper
Pumping languages1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41689601976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40656281975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40691841975-01-01Paper
Sums of Distinct Elements from a Fixed Set1975-01-01Paper
Representations of integers as sums of powers with increasing exponents — II1975-01-01Paper
Periodicity of Recurring Sequences in Rings.1974-01-01Paper
Expressing a prime as difference between two numbers containing all the previous primes1974-01-01Paper
On Exponential Recurring Sequences.1974-01-01Paper
Linear Recurring Sequences in Boolean Rings.1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44049881973-01-01Paper
Representations of integers as sums of powers with increasing exponents1972-01-01Paper
Power Sums of Integers with Missing Digits.1971-01-01Paper
Density Problems for p (n )1970-01-01Paper
Recurrence Formulae for the Coefficients of Modular Forms.1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56484161970-01-01Paper
Recurrence Formulae for the Coefficients of Modular Forms and Congruences for the Partition Function and for the Coefficients of $j(\tau)$, $(j(\tau) - 1728)^{\frac{1}{2}}$ and $(j(\tau))^{\frac{1}{3}}$.1968-01-01Paper
Congruence Properties and Density Problems for the Fourier Coefficients of Modular Forms.1968-01-01Paper

Research outcomes over time

This page was built for person: Torleiv Kløve