Covering codes and extremal problems from invariant sets under permutations

DOI10.1016/J.DISC.2012.10.002zbMath1259.94078OpenAlexW2054639264MaRDI QIDQ1928444

Emerson L. Monte Carmelo

Publication date: 3 January 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.10.002

zbMATH Keywords

invariant setmatchingpermutationindependent setcovering codesbounds on code

Mathematics Subject Classification ID

Bounds on codes (94B65) Other combinatorial number theory (11B75) Transversal (matching) theory (05D15) Directed graphs (digraphs), tournaments (05C20) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71)

Related Items (1)

Invariant sets under linear operator and covering codes over modules

This page was built for publication: Covering codes and extremal problems from invariant sets under permutations