Bounds on Covering Codes in RT spaces using Ordered Covering Arrays
Andr\'e Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura,, Daniel Panario, Brett Stevens
TL;DR
This paper develops new bounds on covering codes in Rosenbloom-Tsfasman spaces by constructing ordered covering arrays, advancing the theoretical understanding of code coverage in these specialized metric spaces.
Contribution
It introduces novel constructions of ordered covering arrays to derive improved upper bounds on covering codes in RT spaces, extending previous results.
Findings
New upper bounds on covering codes in RT spaces
Construction methods for ordered covering arrays
Enhanced understanding of code coverage in RT spaces
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.