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

Computer Communications

A new approach to the information set decoding algorithm

Dulte José de Barros, Walter Godoy, Emílio C. G. Wille

Published Jun 1, 1997• 14 citations
Publisher
DOI
10.1016/s0140-3664(97)00018-2

Related papers

Quantum Information Set Decoding Algorithms

Ghazal Kachigar, Jean–Pierre Tillich

Lecture notes in computer science•Jan 1, 2017•76 citations

Memory-Efficient Quantum Information Set Decoding Algorithm

Naoto Kimura, Atsushi Takayasu, Tsuyoshi Takagi

Lecture notes in computer science•Jan 1, 2023•9 citations

Improved Quantum Information Set Decoding Algorithm with Low Memory

直人 木村, 敦 高安, 剛 高木

IEICE Technical Report; IEICE Tech. Rep.•May 13, 2020•0 citations

An Iterative Soft-Decision Decoding Algorithm

Takuya Koumoto

•Mar 22, 1996•0 citations

A Simple Algorithm for Decoding of Binary Block Codes Based on Information Sets

Walter Godoy, Emílio C. G. Wille, Ricardo P. Jasinski

In this paper we propose a new soft decision decoding algorithm for binary block codes, based on information sets, aiming at a low complexity and suitable for hardware and FPGA implementation. In this new algorithm, a preprocessed list of information sets is utilized to generate the candidate code words. The acceptance criterion of Barros, Godoy and Wille (BGW) is used to reduce the number of candidate words evaluated during decoding process. The performance of the proposed algorithm is nearly identical to the maximum likelihood decoder (MLD), however it compares favorably in terms of complexity. The performance gap, when compared with the MLD, can be reduced in function of the processing effort, as shown by results obtained from computer simulation for the C(15,7), C(23,12), and C(24,12) binary block codes.

•Jan 1, 2010•1 citation

Adaptive Decoding of Binary Linear Block Codes Using Information Sets and Erasures

Walter Godoy, Emílio C. G. Wille, João Augusto Teixeira da Cunha

This paper proposes an information-set based soft-decision decoding algorithm for binary linear block codes. In this new algorithm a list of symbol positions that are able to generate a valid information set is obtained, in advance, by using pre-processing. During the decoding process, the algorithm reconstructs a code-word by means of the information sets from the list. Early termination of the decoding process is based on the acceptance criterion of Barros, Godoy and Wille (BGW). If the BGW criterion was not satisfied, the candidate code-word is changed via bit exchanges (erasures) and reconstructed in order to identify the wrong bits. The performance of the proposed algorithm is quite favorable, being comparable to the maximum-likelihood decoding performance, as shown by results obtained from computer simulation. This paper also demonstrates the equivalency between the BGW criterion and the Taipale and Pursley criterion, proposed independently in 1993 and in 1989 respectively.

International Conference on Communication Theory, Reliability, and Quality of Service (CTRQ)•Jan 1, 2010•1 citation
In this paper we propose a new soft decision decoding algorithm for binary block codes, based on information sets, aiming at a low complexity and suitable for hardware and FPGA implementation. In this new algorithm, a preprocessed list of information sets is utilized to generate the candidate code words. The acceptance criterion of Barros, Godoy and Wille (BGW) is used to reduce the number of candidate words evaluated during decoding process. The performance of the proposed algorithm is nearly identical to the maximum likelihood decoder (MLD), however it compares favorably in terms of complexity. The performance gap, when compared with the MLD, can be reduced in function of the processing effort, as shown by results obtained from computer simulation for the C(15,7), C(23,12), and C(24,12) binary block codes.
This paper proposes an information-set based soft-decision decoding algorithm for binary linear block codes. In this new algorithm a list of symbol positions that are able to generate a valid information set is obtained, in advance, by using pre-processing. During the decoding process, the algorithm reconstructs a code-word by means of the information sets from the list. Early termination of the decoding process is based on the acceptance criterion of Barros, Godoy and Wille (BGW). If the BGW criterion was not satisfied, the candidate code-word is changed via bit exchanges (erasures) and reconstructed in order to identify the wrong bits. The performance of the proposed algorithm is quite favorable, being comparable to the maximum-likelihood decoding performance, as shown by results obtained from computer simulation. This paper also demonstrates the equivalency between the BGW criterion and the Taipale and Pursley criterion, proposed independently in 1993 and in 1989 respectively.