The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces

DOI10.1016/j.disc.2015.05.011zbMath1321.94134arXiv1301.5915OpenAlexW1959449638MaRDI QIDQ2515553

Marcelo Firer, Rafael G. L. D'Oliveira

Publication date: 5 August 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5915

zbMATH Keywords

error correction codesposet codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (6)

Perfect codes in poset spaces and poset block spaces ⋮ Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Linear codes on posets with extension property ⋮ Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code ⋮ On perfect poset codes ⋮ Codes with a pomset metric and constructions

Uses Software

• APL

Cites Work

• The poset structures admitting the extended binary Hamming code to be a perfect code
• A combinatorial problem for vector spaces over finite fields
• A complete anytime algorithm for number partitioning
• Canonical- systematic form for codes in hierarchical poset metrics
• Codes with a poset metric
• Two Notes on Notation
• Reducibility among Combinatorial Problems
• Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
• A method of syntax specification

This page was built for publication: The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces