On the average Hamming distance and mean square deviation for binary superimpose code \delta \left({n,d,k,} \right)

MaRDI QIDQ5382255zbMATH OpenFDO

Authors Qiongyang Wu, Li-fang Huo

Publication date 21 June 2019

zbMATH Keywords

average Hamming distancebinary superimposed codecombinatorial functionmean square deviation

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• scientific article; zbMATH DE number 7366820
• On the average Hamming distance and mean square deviation for binary superimposed code \({M_q}\left( {n,k,d} \right)\)
• Error-detecting and error-correcting properties of binary superposition code \({M_q}(i: n, k, d)\)
• On the average Hamming distance for binary codes
• scientific article; zbMATH DE number 2154113

Cited in

(4)

• scientific article; zbMATH DE number 7366820 (Why is no real title available?)
• Error-detecting and error-correcting properties of binary superposition code M(i: d, k, n)
• On the average Hamming distance and mean square deviation for binary superimposed code \({M_q}\left( {n,k,d} \right)\)
• A relation between the average Hamming distance and the average Hamming weight of binary codes

This page was built for publication: On the average Hamming distance and mean square deviation for binary superimpose code $\delta \left({n,d,k,} \right)$

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