Nonbinary error-correcting codes with one-time error-free feedback

DOI10.1007/s11122-005-0017-3zbMath1088.94033OpenAlexW2061905264MaRDI QIDQ2388214

L. A. Bassalygo

Publication date: 8 September 2005

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

Full work available at URL: https://doi.org/10.1007/s11122-005-0017-3

zbMATH Keywords

Hamming boundq-ary code

Mathematics Subject Classification ID

Bounds on codes (94B65) Error probability in coding theory (94B70)

Related Items (3)

Coding with noiseless feedback ⋮ Correcting a single error in feedback channels ⋮ Searching with lies under error cost constraints

Cites Work

• Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
• Least adaptive optimal search with unreliable tests
• Unnamed Item

This page was built for publication: Nonbinary error-correcting codes with one-time error-free feedback