The Newton radius of a code is the largest weight of a uniquely correctable error. The covering r... more The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given.
1998 Information Theory Workshop (Cat. No.98EX131), 1998
The Newton radius of a code is the maximal Hamming weight of a correctable error. The Newton radi... more The Newton radius of a code is the maximal Hamming weight of a correctable error. The Newton radius of MDS codes is studied
Bounds on the weight distribution of cosets
Ieee Transactions on Information Theory, Nov 1, 1996
ABSTRACT
Some optimal binary and ternary t-EC-AUED codes
Ieee Transactions on Information Theory, Nov 1, 2009
Codes that can correct up to t symmetric errors and detect all unidirectional errors are studied.... more Codes that can correct up to t symmetric errors and detect all unidirectional errors are studied. BOumlinck and van Tilborg gave a bound on the length of binary such codes. A generalization of this bound to arbitrary alphabet size is given. This generalized BOumlinck-van Tilborg bound, combined with constructions, is used to determine some optimal binary and ternary codes for
Upper and lower bounds on the average worst-case probability of undetected error for linear [ n ,... more Upper and lower bounds on the average worst-case probability of undetected error for linear [ n , I;; q] codes are given. Index Terms-Error detection, undetected error, linear codes. For a linear [n. k : q] code C over G F ( q ) , let &(C.p) denote the probability of undetected error when C is used on a q-ary symmetric channel with symbol error probability p . It is well known that where U-(.?) is the Hamming weight of .?.
Algebraic Coding Theory Abstract | Full Text: PDF (222K) Cryptography Abstract | Full Text: PDF (... more Algebraic Coding Theory Abstract | Full Text: PDF (222K) Cryptography Abstract | Full Text: PDF (116K) Data Compression Codes, Lossy Abstract | Full Text: PDF (190K) Estimation Theory Abstract | Full Text: PDF (161K) Image Codes Abstract | Full Text: PDF (399K) Information Theory Abstract | Full Text: PDF (131K) Information Theory of Data Transmission Codes Abstract | Full Text: PDF (265K) Information Theory of Modulation Codes and Waveforms Abstract | Full Text: PDF (794K) Information Theory of Multiaccess Communications Abstract | Full Text: PDF (204K) Information Theory of Radar and Sonar Waveforms Abstract | Full Text: PDF (410K) Information Theory of Spread-Spectrum Communication Abstract | Full Text: PDF (141K) Information Theory of Stochastic Processes Abstract | Full Text: PDF (279K) Maximum Likelihood Imaging Abstract | Full Text: PDF (290K) Queueing Theory Abstract | Full Text: PDF (456K) Signal Detection Theory Abstract | Full Text: PDF (152K) Trellis-Coded Modulation Abstract | Full Text: PDF (143K)
b) At least for any PSD circulant matrix, the new lower bound on A, (with ql = 0) is tighter than... more b) At least for any PSD circulant matrix, the new lower bound on A, (with ql = 0) is tighter than the lower bound on A, presented in (3).
Recurrence formulae for the coefficients of modular forms and congruences for the partition function and for the coefficients of j(τ), (j(τ)-1728) 1/2 and (j(τ)) 1/3
Mathematica Scandinavica
Power sums of integers with missing digits
Mathematica Scandinavica
Density problems for p(n)
Recurrence formulae for the coefficients of modular forms
Uploads
Papers by Torleiv Klove