Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Problems of Information Transmission

Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback

Leonid Alexandrovich Bassalygo

Published Apr 1, 2005• 16 citations
Publisher
DOI
10.1007/s11122-005-0017-3

Related papers

Error-correcting codes for an asymmetric nonbinary channel (Corresp.)

Wan Kim

IRE Transactions on Information Theory•Dec 1, 1959•1 citation

On the Hamming bound for nonbinary localized-error-correcting codes

Leonid Alexandrovich Bassalygo, M.S. Pinsker, Rudolf Ahlswede

Problems of Information Transmission•Jan 1, 1999•5 citations

A Burst Error Correcting Algorithm for Nonbinary LDPC Codes

Yusuke Kimata, Tadashi Wadayama

電子情報通信学会論文誌. A, 基礎・境界•Mar 1, 2013•0 citations

Nonbinary quantum error-correcting codes from algebraic curves

Jon-Lark Kim, Judy L. Walker

Discrete Mathematics•Dec 4, 2007•32 citations

Q-ary Error-Correcting Codes with Feedback

Christian Deppe

•Feb 2, 2019•0 citations

Correcting One Error in Non-Binary Channels with Feedback

Ilya Vorobyev, В. В. Лебедев, Alexey Lebedev

In this paper, the problem of correction of a single error in q-ary symmetric channel with noiseless feedback is considered. We propose an algorithm to construct codes with feedback inductively. For all prime power q we prove that two instances of feedback are sufficient to transmit over the q-ary symmetric channel the same number of messages as in the case of complete feedback. Our other contribution is the construction of codes with one-time feedback with the same parameters as Hamming codes for q that is not a prime power. We also construct single-error-correcting codes with one-time feedback of size qn−2for arbitrary q and n ≤ q + 1, which can be seen as an analog for Reed-Solomon codes.

arXiv:2305.06691•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•3 citations
In this paper, the problem of correction of a single error in q-ary symmetric channel with noiseless feedback is considered. We propose an algorithm to construct codes with feedback inductively. For all prime power q we prove that two instances of feedback are sufficient to transmit over the q-ary symmetric channel the same number of messages as in the case of complete feedback. Our other contribution is the construction of codes with one-time feedback with the same parameters as Hamming codes for q that is not a prime power. We also construct single-error-correcting codes with one-time feedback of size qn−2for arbitrary q and n ≤ q + 1, which can be seen as an analog for Reed-Solomon codes.