AI Chat AI Image Generator AI Video Text to Speech

Bounds on Covering Codes in RT spaces using Ordered Covering Arrays

07/31/2022

∙

by André Guerino Castoldi, et al.

∙

∙

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.

André Guerino Castoldi
3 publications
Emerson Luiz do Monte Carmelo
1 publication
Lucia Moura
7 publications
Daniel Panario
15 publications
Brett Stevens
12 publications

page 1

page 2

page 3

page 4

research

∙ 07/31/2022

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces

This work shows several direct and recursive constructions of ordered co...

0 André Guerino Castoldi, et al. ∙

research

∙ 07/19/2022

Covering Grassmannian Codes: Bounds and Constructions

Grassmannian 𝒢_q(n,k) is the set of all k-dimensional subspaces of the v...

0 Bingchen Qian, et al. ∙

research

∙ 08/31/2021

Upper bounds on the length function for covering codes

The length function ℓ_q(r,R) is the smallest length of a q-ary linear co...

0 Alexander A. Davydov, et al. ∙

research

∙ 05/19/2023

New bounds for covering codes of radius 3 and codimension 3t+1

The smallest possible length of a q-ary linear code of covering radius R...

0 Alexander A. Davydov, et al. ∙

research

∙ 02/26/2023

Optimal local identifying and local locating-dominating codes

We introduce two new classes of covering codes in graphs for every posit...

0 Pyry Herva, et al. ∙

research

∙ 12/19/2017

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5

The length function ℓ_q(r,R) is the smallest length of a q -ary linear ...

0 Daniele Bartoli, et al. ∙

research

∙ 12/07/2011

Multi-granular Perspectives on Covering

Covering model provides a general framework for granular computing in th...

0 Wan-Li Chen, et al. ∙