Covering codes and extremal problems from invariant sets under permutations

DOI10.1016/j.disc.2012.10.002zbMath1259.94078MaRDI 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 set; matching; permutation; independent set; covering codes; bounds on code

Mathematics Subject Classification ID

94B65: Bounds on codes

11B75: Other combinatorial number theory

05D15: Transversal (matching) theory

05C20: Directed graphs (digraphs), tournaments

94B25: Combinatorial codes

94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory

11H71: Relations with coding theory

Related Items

Invariant sets under linear operator and covering codes over modules