Some Upper Bounds on the Covering Radii of Linear CodesOver \F_q and Their Applications

Authors:
H. Janwa;H. F. Mattson; Jr.
Affiliations:
Math. and CS., UPR, P.O. Box 23355, Rio Piedras, PR 00931, and MRI, Chhatnag Road, Jhusi, Allahabad, UP 211019 India;Math. and CS., UPR, P.O. Box 23355, Rio Piedras, PR 00931, and MRI, Chhatnag Road, Jhusi, Allahabad, UP 211019 India;EECS Dept., 2-175 CST, Syracuse University, Syracuse, NY 13244-4100
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 7
Cited 1

A new approach to the covering radius of codes

Journal of Combinatorial Theory Series A
An improved upper bound on covering radius

Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
On the covering radius problem for codes I. bounds on normalized covering radius

SIAM Journal on Algebraic and Discrete Methods
Some optimal codes from algebraic geometry and their covering radii

European Journal of Combinatorics
A note on the covering radius of optimum codes

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Relations among parameters of codes (covering radius, automorphism groups, bounds, t-dense)

Relations among parameters of codes (covering radius, automorphism groups, bounds, t-dense)
Long packing and covering codes

IEEE Transactions on Information Theory

On generalized hamming weights and the covering radius of linear codes

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Periodic binary (plus-minus)sequences all but one of whose out-of-phase autocorrelation coefficientsare zero are studied by Wolfman [6]. Using the equivalence ofthese almost perfect sequences to certain cyclic divisible differencesets (noted ...