Tero Laihonen, Simon Litsyn  Home/Search
Context Related
| tucs.abo.fi/cgibin/getps.cgi...TR80.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: utu.fi/ml/matlts/research/...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietavainen [9] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an application of a shortening method of a code. These results improve on the best presently known... (Update)
Similar documents based on text: More All
0.5: On Covering Radius and Discrete Chebyshev Polynomials - Honkala, Laihonen, Litsyn (1997) (Correct)
0.4: On Upper Bounds for Minimum Distance and Covering Radius of.. - Laihonen (1998) (Correct)
0.4: New Bounds On Covering Radius as a Function of Dual Distance - Laihonen (Correct)
Related documents from co-citation: More All
3: On algebraic methods in covering radius problems (context) - Honkala, Litsyn et al. - 1995
3: On covering radius and discrete Chebyshev polynomials - Honkala, Laihonen et al. - 1997
3: On upper bounds for code distance and covering radius of designs in polynomial m.. (context) - Fazekas, Levenshtein - 1995
BibTeX entry: (Update)
T. Laihonen and S. Litsyn, On upper bounds for minimum distance and covering radius of non-binary codes, Designs, Codes and Cryptography, 14 (1998), pp. 71--80. http://citeseer.ist.psu.edu/article/laihonen98upper.html More
@techreport{ laihonen97upper,
author = "Tero Laihonen and Simon Litsyn",
title = "On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes",
number = "TUCS-TR-80",
month = "20,",
year = "1997",
url = "citeseer.ist.psu.edu/article/laihonen98upper.html" }
Citations (may not include all citations):860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
154 Orthogonal Polynomials (context) - Szego - 1975
97 Introduction to Coding Theory (context) - van Lint - 1982
53 The Chebyshev polynomials (context) - Rivlin - 1974
9 the covering radius of binary codes (context) - Helleseth, Klve et al. - 1978
8 covering radius and eigenvalues (context) - Delorme, Sol'e et al. - 1991
6 On algebraic methods in covering radius problems (context) - Honkala, Litsyn et al. - 1995
6 Upper bounds on the covering radius of a code with a given d.. (context) - Litsyn, Tietavainen
6 A new upper bound on nonbinary block codes (context) - Aaltonen - 1990
5 An upper bound on the covering radius as a function of its d.. (context) - Tietavainen - 1990
5 and dual-distance width (context) - Sol'e, Stokes et al. - 1993
5 Asymptotic bounds on the covering radius of binary codes (context) - Sol'e - 1990
4 Four fundamental parametres of a code and their combinatoria.. (context) - Delsarte - 1973
4 Codes and Cryptography (context) - Tietavainen, radius et al. - 1991
3 Bounds on the information rate of a tree code as a function .. (context) - Aaltonen - 1981
3 Generalization of the Norse bounds to codes of higher streng.. (context) - Sol'e, Mehrotra - 1991
Documents on the same site (http://www.utu.fi/ml/matlts/research/codingtheory/publ.html): More
On Covering Radius and Discrete Chebyshev Polynomials - Honkala, Laihonen, Litsyn (1997) (Correct)
An Elementary Proof to the Weight Distribution Formula of the.. - Tarnanen (1996) (Correct)
Binary Z 4 -linear Codes and Sequences - Ranto (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC