Code bounds for multiple packings over a nonbinary finite alphabet

DOI10.1007/S11122-005-0007-5MaRDI QIDQ2577280zbMATH OpenOpenAlexFDO

Authors Vladimir Blinovsky

Publication date 19 December 2005

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11122-005-0007-5

zbMATH Keywords

\(L\)-packing

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bounds on codes (94B65) Combinatorial inequalities (05A20)

Recommendations

• New asymptotic bounds on the size of multiple packings of the Euclidean sphere
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Bounds for binary multiple covering codes
• A new upper bound on the rate of non-binary codes
• A new upper bound on nonbinary block codes

Cites work

• scientific article; zbMATH DE number 1077413 (Why is no real title available?)
• A strange pigeon-hole principle

Cited in

(7)

• Multiple packing in sum-type metric spaces
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• Generalized bounds and binary/ternary mixed packing and covering codes
• A 2D non-overlapping code over a \(q\)-ary alphabet
• Multiple Packing in Sum-type Metric Spaces
• Singleton-type bounds for list-decoding and list-recovery, and related results
• scientific article; zbMATH DE number 6004916 (Why is no real title available?)

This page was built for publication: Code bounds for multiple packings over a nonbinary finite alphabet

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