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

IEICE Technical Report; IEICE Tech. Rep.

Studies on evaluationg system for q-ary linear block codes based on q-input r-output symmetric channels(2)

Fujikawa Tomohiro, Kazuhiko Yamaguchi

Published Mar 3, 2016• 0 citations
OpenAlex

Related papers

Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q > q

S. Wainberg, Jack Keil Wolf

Information and Control•Apr 1, 1973•9 citations

Estimates of the bit error probabilities for binary linear block codes and symmetric binary-input memoryless channels

Vladimir B. Balakirsky

•Jan 1, 2002•0 citations

Error detecting codes for the q-ary symmetric channel

Series on coding theory and cryptology•Apr 1, 2007•0 citations

Bounds on the Error Probability of Nonbinary Linear Codes over the Q-ary Symmetric Channel

Emna Ben Yacoub, Gianluigi Liva, Enrico Paolini

The block error probability under maximum likelihood decoding of general linear block codes and code ensembles over the q-ary symmetric channel is analyzed. The analysis makes use of two types of upper bounds and it is based on the codes (code ensembles) distance spectra. The first bound generalizes Poltyrev's union bound for the binary symmetric channel. The second bound relies on typical pairs decoding. The two bounds are developed in an asymptotic setting to analyze the behavior of linear block code ensembles, in terms of error exponent and maximum-likelihood decoding threshold. A sphere-packing lower bound is also developed, to provide a reference for the finite-length performance.

Conference on Information Sciences and Systems•Mar 24, 2021•0 citations

Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q greater than q.

S. Wainberg, Jack K. Wolf

Decoding algorithms designed for one output alphabet are shown to be effectively usable for channels with a different output alphabet. The described technique that makes this possible can be used in conjunction with an arbitrary distance measure between input and output vectors. Thus, Hamming distance, Lee distance, or a burst distance can be assumed. Examples are presented for each of these distances.

Information and Computation•Apr 1, 1973•0 citations

Improved EBF algorithm of Q-ary LDPC codes

Ningning Tong, Danfeng Zhao, WU Yu-ping

JOURNAL OF SHENZHEN UNIVERSITY SCIENCE AND ENGINEERING•Oct 14, 2013•0 citations
The block error probability under maximum likelihood decoding of general linear block codes and code ensembles over the q-ary symmetric channel is analyzed. The analysis makes use of two types of upper bounds and it is based on the codes (code ensembles) distance spectra. The first bound generalizes Poltyrev's union bound for the binary symmetric channel. The second bound relies on typical pairs decoding. The two bounds are developed in an asymptotic setting to analyze the behavior of linear block code ensembles, in terms of error exponent and maximum-likelihood decoding threshold. A sphere-packing lower bound is also developed, to provide a reference for the finite-length performance.