On calculation of the interweight distribution of an equitable partition

DOI10.1007/s10801-013-0492-3zbMath1303.05156arXiv1303.0002OpenAlexW2096881539MaRDI QIDQ478353

Denis S. Krotov

Publication date: 3 December 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

equitable partitiondistance distributioninterweight distributionKrawtchouk polynomialstrong distance invariance

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Perfect 2‐colorings of Hamming graphs ⋮ Steganographic schemes from perfect codes on Cayley graphs ⋮ Perfect colorings of regular graphs

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the binary codes with parameters of triply-shortened 1-perfect codes
• On weight distributions of perfect colorings and completely regular codes
• The Terwilliger algebra of the hypercube
• Local and interweight spectra of completely regular codes and of perfect colorings
• On \(r\)-partition designs in Hamming spaces
• Coherent configurations. I: Ordinary representation theory
• A bound on correlation immunity
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• Calculation of error probabilities for distance-invariant nonlinear error control codes
• The Geometry of Two-Weight Codes

This page was built for publication: On calculation of the interweight distribution of an equitable partition