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

Information and Control

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

S. Wainberg, Jack Keil Wolf

Published Apr 1, 1973• 9 citations
Publisher
DOI
10.1016/s0019-9958(73)90283-0

Related papers

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

Fujikawa Tomohiro, Kazuhiko Yamaguchi

IEICE Technical Report; IEICE Tech. Rep.•Mar 3, 2016•0 citations

A Soft-input and output Iterative Decoding Algorithm using an Algebraic Decoding for Non-binary Codes

Hitoshi Tokushige

International Symposium on Information Theory and its Applications•Jan 1, 2002•1 citation

The decoding of binary quasi-cyclic codes

P. Heijnen, Henk C. A. van Tilborg

•Jan 1, 1998•4 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

Algebraic coding for iterative decoding

Pascal O. Vontobel

•Jan 1, 2003•13 citations

Burst decoding of binary block codes on Q-ary output channels.

S. Wainberg, Jack K. Wolf

The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.

IEEE Transactions on Information Theory•Sep 1, 1972•17 citations