The following pages link to Torleiv Kløve (Q182048):
Displaying 50 items.
- On covering sets for limited-magnitude errors (Q276564) (← links)
- Linear covering codes and error-correcting codes for limited-magnitude errors (Q398936) (← links)
- (Q866018) (redirect page) (← links)
- Weight hierarchies of linear codes satisfying the almost chain condition (Q866019) (← links)
- The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\) (Q1135270) (← links)
- The modular n-queen problem. II (Q1154471) (← links)
- Lower bounds on multiple difference sets (Q1185085) (← links)
- Support weight distribution of linear codes (Q1199617) (← links)
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\) (Q1239128) (← links)
- On complements of unary L languages (Q1243141) (← links)
- The weight distribution for a class of irreducible cyclic codes (Q1244321) (← links)
- The modular n-queen problem (Q1246430) (← links)
- On the no-three-in-line problem. II (Q1252347) (← links)
- On the no-three-in-line problem. III (Q1252348) (← links)
- Weight hierarchies of linear codes satisfying the chain condition (Q1273506) (← links)
- How to build robust shared control systems (Q1273533) (← links)
- New construction of disjoint distinct difference sets (Q1273535) (← links)
- Bounds on the weight hierarchies of extremal non-chain codes of dimension 4 (Q1360986) (← links)
- Disjoint sets of distinct sum sets (Q1377746) (← links)
- On codes satisfying the double chain condition (Q1377755) (← links)
- Hypercubic 4 and 5-designs from double-error-correcting BCH codes (Q1395765) (← links)
- Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets (Q1406880) (← links)
- Codes of length two correcting single errors of limited size. II (Q1725948) (← links)
- On equidistant constant weight codes (Q1811100) (← links)
- Finite projective geometries and classification of the weight hierarchies of codes. I (Q1887426) (← links)
- Lower bounds on multiple distinct sum sets (Q1910537) (← links)
- On generalization of sonar sequences and intermodulation-free frequencies assignment sequences (Q1920028) (← links)
- Generating functions for the number of permutations with limited displacement (Q2380262) (← links)
- Lower bounds on the size of spheres of permutations under the Chebychev distance (Q2430688) (← links)
- On the second greedy weight for linear codes satisfying the fullrank condition (Q2583102) (← links)
- Codes of length two correcting single errors of limited size (Q2632845) (← links)
- (Q2741409) (← links)
- Two Constructions of Covering Sets for Limited-Magnitude Errors (Q2976953) (← links)
- Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes (Q2989860) (← links)
- On Robinson's coding problem (Corresp.) (Q3041082) (← links)
- (Q3128814) (← links)
- Using codes for error correction and detection (Corresp.) (Q3222114) (← links)
- The minimal range of additive $h$-bases. (Q3315603) (← links)
- The probability of undetected error when a code is used for error correction and detection (Corresp.) (Q3323849) (← links)
- Generalizations of the Korzhik bound (Corresp.) (Q3346224) (← links)
- (Q3445782) (← links)
- Codes of Length 2 Correcting Single Errors of Limited Size (Q3460107) (← links)
- Bounds and constructions of disjoint sets of distinct difference sets (Q3481640) (← links)
- Two Constructions of Permutation Arrays (Q3546483) (← links)
- On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex< (Q3546697) (← links)
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares (Q3546729) (← links)
- The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction (Q3546992) (← links)
- Error-Correction Capability of Binary Linear Codes (Q3546994) (← links)
- Diversity Combining for the Z-Channel (Q3547135) (← links)
- The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes (Q3547136) (← links)
