article

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

Authors:

G. Fazekas,

V. I. LevenshteinAuthors Info & Claims

Journal of Combinatorial Theory Series A, Volume 70, Issue 2

Pages 267 - 288

https://doi.org/10.1016/0097-3165(95)90093-4

Published: 01 May 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Vallentin FMoustrou P(2023)Least distortion Euclidean embeddings of flat toriProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597147(13-23)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597147
Bazzi L(2019)On the Covering Radius of Small Codes Versus Dual DistanceIEEE Transactions on Information Theory10.1109/TIT.2018.285749565:1(174-183)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1109/TIT.2018.2857495
Ashikhmin ABarg A(2002)Bounds on the Covering Radius of Linear CodesDesigns, Codes and Cryptography10.1023/A:101999510540527:3(261-269)Online publication date: 1-Dec-2002
https://dl.acm.org/doi/10.1023/A%3A1019995105405
Show More Cited By

Index Terms

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

Recommendations

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
On Upper Bounds for Minimum Distance and Covering Radiusof Non-binary Codes

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. Tietäväinen lt:newu and ...
Packing radius, covering radius, and dual distance

Tietaivainen (1991) derived an upper bound on the covering radius of codes as a function of the dual distance. This was generalized to the minimum distance, and to Q-polynomial association schemes by Levenshtein and Fazekas. Both proofs use a linear ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Combinatorial Theory Series A

Journal of Combinatorial Theory Series A Volume 70, Issue 2

May 1995

179 pages

ISSN:0097-3165

Editors:
Basil Gordon
Univ. of California, Los Angeles
,
Bruce Rothschild
Univ. of California, Los Angeles

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 May 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vallentin FMoustrou P(2023)Least distortion Euclidean embeddings of flat toriProceedings of the 2023 International Symposium on Symbolic and Algebraic Computation10.1145/3597066.3597147(13-23)Online publication date: 24-Jul-2023
https://dl.acm.org/doi/10.1145/3597066.3597147
Bazzi L(2019)On the Covering Radius of Small Codes Versus Dual DistanceIEEE Transactions on Information Theory10.1109/TIT.2018.285749565:1(174-183)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1109/TIT.2018.2857495
Ashikhmin ABarg A(2002)Bounds on the Covering Radius of Linear CodesDesigns, Codes and Cryptography10.1023/A:101999510540527:3(261-269)Online publication date: 1-Dec-2002
https://dl.acm.org/doi/10.1023/A%3A1019995105405
Boyvalenkov PBoumova SDanev D(1999)Necessary Conditions for Existence of Some Designs in Polynomial Metric SpacesEuropean Journal of Combinatorics10.1006/eujc.1998.027820:3(213-225)Online publication date: 1-Apr-1999
https://dl.acm.org/doi/10.1006/eujc.1998.0278

Abstract

Cited By

Index Terms

Recommendations

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

On Upper Bounds for Minimum Distance and Covering Radiusof Non-binary Codes

Packing radius, covering radius, and dual distance

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations