journal article Jul 10, 1997

On Covering Radius and Discrete Chebyshev Polynomials

I. Honkala T. Laihonen S. Litsyn

Applicable Algebra in Engineering, Communication and Computing Vol. 8 No. 5 pp. 395-401 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/s002000050077

Topics

No keywords indexed for this article. Browse by subject →

Metrics

7

Citations

0

References

Details

Published: Jul 10, 1997
Vol/Issue: 8(5)
Pages: 395-401
License: View

Authors

Cite This Article

I. Honkala, T. Laihonen, S. Litsyn (1997). On Covering Radius and Discrete Chebyshev Polynomials. Applicable Algebra in Engineering, Communication and Computing, 8(5), 395-401. https://doi.org/10.1007/s002000050077

Related

You May Also Like

CHEVIE ? A system for computing and processing generic character tables

Meinolf Geck, Gerhard Hiss · 1996

239 citations

Skew-cyclic codes

D. Boucher, W. Geiselmann · 2007

182 citations

Combinatorial Group Theory and Public Key Cryptography

Vladimir Shpilrain, Gabriel Zapata · 2006

34 citations

Optimal RS-like LRC codes of arbitrary length

Charul Rajput, Maheshanand Bhaintwal · 2020

3 citations

Quasi self-dual codes over $$S_{m}(\mathbb {F}_{2})$$

Jupiter Pilongo, Rowena Alma Betty · 2026