On rank and kernel of some mixed perfect codes

DOI10.1016/j.disc.2008.06.037zbMath1189.94060OpenAlexW2066472993MaRDI QIDQ1043626

Thomas Westerbäck, Fabio Pasticci

Publication date: 9 December 2009

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

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

zbMATH Keywords

rankFourier coefficientmixed perfect code

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Unnamed Item
• On the reconstruction of perfect codes
• On perfect codes: Rank and kernel
• The classification of some perfect codes
• On the ranks and kernels problem for perfect codes
• A full rank perfect code of length 31
• Group Partitions and Mixed Perfect Codes
• A new construction of group and nongroup perfect codes
• On Perfect Codes and Tilings: Problems and Solutions
• Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist
• Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
• Group Partition, Factorization and the Vector Covering Problem

This page was built for publication: On rank and kernel of some mixed perfect codes