Binomial coefficient codes over GF(2)

DOI10.1016/0012-365X(92)90545-QMaRDI QIDQ1199598zbMATH OpenWikidataFDO

Authors Persi Diaconis, Ron Graham

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

weight enumeratorsbinomial coefficient codescodes over GF(2)random walks on the \(n\)-cube \(GF(2)^ n\)

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Binary cyclic codes from trinomials over GF(\(2^m\))
• scientific article; zbMATH DE number 3970681
• Codes over Gaussian integers
• Biquadratic residue codes over \(F_2\)
• Cyclic Codes Over Gf(4) and Gf(2)
• Gröbner bases and combinatorics for binary codes
• (L,g)-codes and binary forms
• scientific article; zbMATH DE number 3212637
• Codes derived from binary Goppa codes

Cites work

• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• An affine walk on the hypercube

Cited in

(4)

• Correction to: ``Speeding up Markov chains with deterministic jumps
• The-square-and-add Markov chain
• An affine walk on the hypercube
• Speeding up Markov chains with deterministic jumps

This page was built for publication: Binomial coefficient codes over GF(2)

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