Bounds on covering codes in RT spaces using ordered covering arrays

Castoldi, André Guerino; Monte Carmelo, Emerson Luiz do; Moura, Lucia; Panario, Daniel; Stevens, Brett

doi:10.1007/978-3-030-21363-3_9

Castoldi, A.G. (André Guerino), Monte Carmelo, E.L. (Emerson Luiz do), Moura, L. (Lucia), D. Panario (Daniel) and B. Stevens (Brett)

2019

Bounds on covering codes in RT spaces using ordered covering arrays

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.

Additional Metadata
Keywords	Bounds on codes, Covering codes, Ordered covering arrays, Rosenbloom-tsfasman metric
Persistent URL	doi.org/10.1007/978-3-030-21363-3_9
Series	Lecture Notes in Computer Science
Organisation	School of Mathematics and Statistics
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Castoldi, A.G. (André Guerino), Monte Carmelo, E.L. (Emerson Luiz do), Moura, L. (Lucia), Panario, D, & Stevens, B. (2019). Bounds on covering codes in RT spaces using ordered covering arrays. In Lecture Notes in Computer Science. doi:10.1007/978-3-030-21363-3_9

Bounds on covering codes in RT spaces using ordered covering arrays

Publication

Publication

Bounds on covering codes in RT spaces using ordered covering arrays

Publication

Publication

Workflow

Workflow

Add Content