BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically

zbMATH Open1410.94119MaRDI QIDQ2816042FDOQ2816042

Authors: Zdzisław Skupień 

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305800903?np=y

Recommendations

• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• On a hypercube coloring problem
• Spectra of long primitive binary BCH codes cannot approach the binomial distribution
• A limit law on the distance distribution of binary codes
• BCH codes with minimum distance proportional to code length

zbMATH Keywords

binary primitive narrow-sense BCH codesradio frequencies allocation problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Cyclic codes (94B15)

Cited In (2)

• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Trees with maximum number of maximal matchings

This page was built for publication: BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816042)