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

Springer eBooks

Syndrome Decoding and Some Important Linear Block Codes

Orhan Gazi

Published Dec 4, 2019• 1 citation
Publisher
DOI
10.1007/978-3-030-33380-5_3

Related papers

A quantum algorithm for syndrome decoding of classical error-correcting linear block codes

Mainak Bhattacharyya, Ankur Raina

Decoding of linear block codes using syndrome decoding and finding whether there exists a codeword of weight$w$in a set of codewords are known to belong to a class of NP-complete problems. For syndrome decoding of linear block codes, we provide an algorithm that gives a probabilistic solution with least Hamming weight. The algorithm can speed up this process significantly with the help of quantum search algorithm. For this, we make use of a search algorithm inspired from Grover's search. We also suggest a general approach for building a quantum circuit for syndrome detection. We test the algorithm in IBM Quantum Experience using qasm simulator and perform the complexity analysis identifying the algorithm's domain of utility.

IEEE/ACM Symposium on Edge Computing (SEC)•Dec 1, 2022•7 citations

Methods for constructing and decoding block error-correcting codes

Abdullah A. Hashim

•Jan 1, 1974•0 citations

Revisiting Classical Syndrome Decoding

Zunaira Babar, Daryus Chandra, Soon Xin Ng +1 more

We commence by discussing classical syndrome decoding techniques that form the foundation for quantum error correction. Explicitly, they allow us to ascertain where the depolarization-induced errors occur and then to correct them without observing the quantum bits themselves. We then continue with a review of look-up table-based syndrome decoding designed for linear block codes, followed by the construction of syndrome-based error trellises for both block and convolutional codes. The chapter introduces trellis-based decoding using both the Viterbi and the Maximum A Posteriori algorithms, emphasizing their role in estimating the error patterns encountered from syndrome sequences. A reduced-complexity block syndrome decoding-based technique is presented for improving the decoding efficiency of turbo trellis coded modulation (TTCM) schemes. Simulation results recorded for transmission over AWGN and Rayleigh fading channels demonstrate significant complexity reductions, quantified in terms of the number of non-decoded blocks and the average number of iterations. The chapter concludes by highlighting the block syndrome decoder's potential for future designs.

Wiley eBooks•Dec 18, 2025•0 citations

Linear Block Codes

Giuliano G. La Guardia

Quantum science and technology•Jan 1, 2020•0 citations

Iterative Decoding of Product Codes Based on Syndrome Decoding of Sub-Codes

Zongwang Li, Youyun Xu, Wentao Song

IEICE Transactions on Communications•Oct 1, 2002•1 citation

Error Correcting Ability of Linear Block Codes

辰一 小島

群馬大学教育学部紀要. 自然科学編•Jan 1, 1989•0 citations
Decoding of linear block codes using syndrome decoding and finding whether there exists a codeword of weightwwwin a set of codewords are known to belong to a class of NP-complete problems. For syndrome decoding of linear block codes, we provide an algorithm that gives a probabilistic solution with least Hamming weight. The algorithm can speed up this process significantly with the help of quantum search algorithm. For this, we make use of a search algorithm inspired from Grover's search. We also suggest a general approach for building a quantum circuit for syndrome detection. We test the algorithm in IBM Quantum Experience using qasm simulator and perform the complexity analysis identifying the algorithm's domain of utility.
We commence by discussing classical syndrome decoding techniques that form the foundation for quantum error correction. Explicitly, they allow us to ascertain where the depolarization-induced errors occur and then to correct them without observing the quantum bits themselves. We then continue with a review of look-up table-based syndrome decoding designed for linear block codes, followed by the construction of syndrome-based error trellises for both block and convolutional codes. The chapter introduces trellis-based decoding using both the Viterbi and the Maximum A Posteriori algorithms, emphasizing their role in estimating the error patterns encountered from syndrome sequences. A reduced-complexity block syndrome decoding-based technique is presented for improving the decoding efficiency of turbo trellis coded modulation (TTCM) schemes. Simulation results recorded for transmission over AWGN and Rayleigh fading channels demonstrate significant complexity reductions, quantified in terms of the number of non-decoded blocks and the average number of iterations. The chapter concludes by highlighting the block syndrome decoder's potential for future designs.