concatenated codes
Recently Published Documents


TOTAL DOCUMENTS

312
(FIVE YEARS 35)

H-INDEX

22
(FIVE YEARS 2)

Cryptography ◽  
2021 ◽  
Vol 5 (4) ◽  
pp. 33
Author(s):  
Johann-Philipp Thiers ◽  
Jürgen Freudenberger

The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim error channel, where the error values are limited to the Mannheim weight one. Due to the limited error values, the codes over Gaussian integers achieve a higher error correction capability than maximum distance separable (MDS) codes with bounded minimum distance decoding. This higher error correction capability improves the work factor regarding decoding attacks based on information-set decoding. The codes also enable a low complexity decoding algorithm for decoding beyond the guaranteed error correction capability. In this work, we extend this coding scheme to codes over Eisenstein integers. These codes have advantages for the Niederreiter system. Additionally, we propose an improved code construction based on generalized concatenated codes. These codes extend to the rate region, where the work factor is beneficial compared to MDS codes. Moreover, generalized concatenated codes are more robust against structural attacks than ordinary concatenated codes.


2021 ◽  
Author(s):  
Muhammad Umar Farooq ◽  
Alexandre Graell i Amat ◽  
Michael Lentmaier

2021 ◽  
Author(s):  
Chaojie Yang ◽  
Shancheng Zhao ◽  
Xiao Ma

2021 ◽  
Author(s):  
Mojtaba Mahdavi ◽  
Liang Liu ◽  
Ove Edfors ◽  
Michael Lentmaier ◽  
Norbert Wehn ◽  
...  

2021 ◽  
Author(s):  
Jihao Fan ◽  
Jun Li ◽  
Ya Wang ◽  
Yonghui Li ◽  
Min-Hsiu Hsieh ◽  
...  

Abstract We utilize a concatenation scheme to construct new families of quantum error correction codes that include the Bacon-Shor codes. We show that our scheme can lead to asymptotically good quantum codes while Bacon-Shor codes cannot. Further, the concatenation scheme allows us to derive quantum LDPC codes of distance Ω(N2/3/loglogN) which can improve Hastings’s recent result [arXiv:2102.10030] by a polylogarithmic factor. Moreover, assisted by the Evra-Kaufman- Zémor distance balancing construction, our concatenation scheme can yield quantum LDPC codes with non-vanishing code rates and better minimum distance upper bound than the hypergraph product quantum LDPC codes. Finally, we derive a family of fast encodable and decodable quan- tum concatenated codes with parameters Q = [[N,Ω(√N),Ω(√N)]] and they also belong to the Bacon-Shor codes. We show that Q can be encoded very efficiently by circuits of size O(N) and depth O(√N), and can correct any adversarial error of weight up to half the minimum distance bound in O(√N) time. To the best of our knowledge, they are the most powerful quantum codes for correcting so many adversarial errors in sublinear time by far.


Sign in / Sign up

Export Citation Format

Share Document