Results 21 to 30 of about 182,933 (316)

Graph-Based Codes and Iterative Decoding [PDF]

, 2003
The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core   +1 more source

Asymptotic optimality of antidictionary codes [PDF]

2010 IEEE International Symposium on Information Theory, 2010
5 pages, to appear in the proceedings of 2010 IEEE International Symposium on Information Theory (ISIT2010)
Takahiro Ota, Hiroyoshi Morita
openaire   +2 more sources

EXIT Chart Aided Design of Periodically Punctured Turbo Codes [PDF]

, 2010
EXtrinsic Information Transfer (EXIT) charts have proved to be an effective tool for studying the convergence behaviour of iterative decoders. However, classical EXIT chart analysis fails to assess the performance of turbo codes in which the systematic ...
BABICH, FULVIO, A. Crismani, CRISMANI, ALESSANDRO, Maunder R. G., Crismani, A., Babich, F., F. Babich, R.G. Maunder, Maunder, R. G.   +8 more
core   +1 more source

Short Low-Rate Non-Binary Turbo Codes

, 2012
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields.
Paolini, Enrico, G. Liva, Balazs Matuz, B. Matuz, Marco Chiani, Liva, Gianluigi, Chiani, Marco, Matuz, Balazs, Gianluigi Liva, Enrico Paolini   +9 more
core   +1 more source

Optimal minimal linear codes from posets

, 2020
Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes.
Wu, Yansheng, Kim, Hyun Kwang, Hyun, Jong Yoon, Yue, Qin   +3 more
core   +1 more source

Cyclic Codes over a Split Local Ring of Type (2,2): Structure, Gray Images, and Distance Analysis

Mathematics
We study cyclic codes over split two-branch finite local rings of the form Rl,m=Fp[u,v]/⟨ul,vm,uv⟩,l,m≥2, whose radical filtration is governed by two independent nilpotent chains: u→u2→⋯→ul−1→0andv→v2→⋯→vm−1→0.
Sami H. Saif, Alhanouf Ali Alhomaidhi
doaj   +1 more source

Construction of a Class of Real Array Rank Distance Codes

Journal of Electrical and Computer Engineering, 2023
Rank distance codes are known to be applicable in various applications such as distributed data storage, cryptography, space time coding, and mainly in network coding.
N. Suresh Babu, B. Ravivarma, E. M. Elsayed, K. G. Sreekumar   +3 more
doaj   +1 more source

Sliding-window dynamic frameproof codes [PDF]

, 2007
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper, we formally define sliding-window dynamic frameproof codes and provide optimal constructions ...
Paterson, Maura, Paterson, Maura B.
core   +1 more source

On optimal constacyclic codes

Linear Algebra and its Applications, 2016
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters.
openaire   +3 more sources

From Product Codes to Structured Generalized LDPC Codes

, 2010
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico, Michael Lentmaier, G. Liva, G. Fettweis, Fettweis, Gerhard, Gerhard Fettweis, Lentmaier, Michael, Liva, Gianluigi, Gianluigi Liva, M. Lentmaier, Enrico Paolini   +10 more
core   +1 more source