Short covering codes arising from matchings in weighted graphs
From MaRDI portal
Publication:4911918
DOI10.1090/S0025-5718-2012-02613-5zbMath1293.94135MaRDI QIDQ4911918
Anderson Novaes Martinhão, Emerson L. Monte Carmelo
Publication date: 20 March 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2012-02613-5
05C90: Applications of graph theory
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11B75: Other combinatorial number theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Toroidal boards and code covering, New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems on sum-free sets and coverings in tridimensional spaces
- A covering problem over finite rings
- Efficient algorithms for variants of weighted matching and assignment problems
- Bounds for short covering codes and reactive tabu search
- On covering and coloring problems for rook domains
- Short coverings in tridimensional spaces arising from sum-free sets
- Short coverings and matching in weighted graphs
- A Combinatorial Problem in Matching
- On a Covering Problem Concerning Abelian Groups
- A Covering Theorem for Abelian Groups