Ordered covering arrays and upper bounds on covering codes
DOI10.1002/jcd.21882arXiv2208.01410OpenAlexW4361269916MaRDI QIDQ6086204
Daniel Panario, André Guerino Castoldi, Lucia Moura, Emerson L. Monte Carmelo, Brett Stevens
Publication date: 9 November 2023
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.01410
bounds on codesordered orthogonal arraycovering arraycovering codeNiederreiter-Rosenbloom-Tsfasman metricordered covering array
Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- Covering and radius-covering arrays: constructions and classification
- More coverings by rook domains
- Bursts in \(m\)-metric array codes
- The covering problem in Rosenbloom-Tsfasman spaces
- Finite field constructions of combinatorial arrays
- The covering problem for finite rings with respect to the RT-metric
- On covering and coloring problems for rook domains
- Orthogonal arrays. Theory and applications
- Codes for the \(m\)-metric
- Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
- Codes with a poset metric
- An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
- Bounds on covering codes in RT spaces using ordered covering arrays
- Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- Strength two covering arrays: existence tables and projection
- Families of \(k\)-independent sets
- Ordered Orthogonal Array Construction Using LFSR Sequences
- On the state of strength-three covering arrays
- Poset Codes: Partial Orders, Metrics and Coding Theory
- Bounds on ordered codes and orthogonal arrays
- Variable strength covering arrays
This page was built for publication: Ordered covering arrays and upper bounds on covering codes
