Sign Up to like & get
recommendations!
1
Published in 2021 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2021.3110236
Abstract: By exploiting the subblock structure of a tensor product code, we provide an upper bound on the maximum correctable burst length of tensor product codes used with interleavers designed based on only the minimum distance…
read more here.
Keywords:
product codes;
product;
tensor product;
optimal interleavers ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2022.3207802
Abstract: A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the…
read more here.
Keywords:
parity check;
single parity;
successive cancellation;
product ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2017 at "International Journal of Quantum Information"
DOI: 10.1142/s0219749917500034
Abstract: As in classical coding theory, turbo product codes (TPCs) through serially concatenated block codes can achieve approximatively Shannon capacity limit and have low decoding complexity. However, special requirements in the quantum setting severely limit the…
read more here.
Keywords:
product codes;
turbo product;
quantum;
type quantum ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "EURASIP Journal on Wireless Communications and Networking"
DOI: 10.1186/s13638-020-01740-2
Abstract: This paper introduces two effective techniques to reduce the decoding complexity of turbo product codes (TPC) that use extended Hamming codes as component codes. We first propose an advanced hard-input soft-output (HISO) decoding algorithm, which…
read more here.
Keywords:
product codes;
turbo product;
decoding algorithm;
complexity ... See more keywords