The asymptotic number of solutions of a diophantine equation from coding theory

DOI10.1016/0097-3165(75)90011-4zbMath0301.10023OpenAlexW1996548577MaRDI QIDQ1215657

David W. Boyd

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90011-4

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Counting solutions of Diophantine equations (11D45) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (4)

Compositions into powers of \(b\): asymptotic enumeration and parameters ⋮ Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis ⋮ On the vector space of the automatic reals ⋮ Searching and encoding for infinite ordered sets

Cites Work

• Two inequalities implied by unique decipherability
• Generation and enumeration of all solutions of the characteristic sum condition
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic number of solutions of a diophantine equation from coding theory