Skip to main content
Conference Proceedings

Bounds on covering codes in RT spaces using ordered covering arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11545 LNCS 100-111
DOI: 10.1007/978-3-030-21363-3_9
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving or extending some previous results.

Author supplied keywords

Cite

CITATION STYLE

APA

Castoldi, A. G., Monte Carmelo, E. L. do, Moura, L., Panario, D., & Stevens, B. (2019). Bounds on covering codes in RT spaces using ordered covering arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11545 LNCS, pp. 100–111). Springer Verlag. https://doi.org/10.1007/978-3-030-21363-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free