Results 11 to 20 of about 279 (76)
Automorphism Ensemble Polar Code Decoders for 6G URLLC
, 2023 The URLLC scenario in the upcoming 6G standard requires low latency and ultra reliable transmission, i.e., error correction towards ML performance. Achieving near-ML performance is very challenging especially for short block lengths. Polar codes are a promising candidate and already part of the 5G standard.
Kestel, Claus +4 more
openaire +2 more sources
Transitive and self-dual codes attaining the Tsfasman-Vladut-Zink bound [PDF]
, 2005 A major problem in coding theory is the question of whether the class of cyclic codes is asymptotically good. In this correspondence-as a generalization of cyclic codes-the notion of transitive codes is introduced (see Definition 1.4 in Section I), and ...
Stichtenoth, Henning
core +2 more sources
Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields [PDF]
, 2011 The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight ...
Chen, Yan +4 more
core +1 more source
Algebraic Properties of Polar Codes From a New Polynomial Formalism [PDF]
, 2016 Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding.
Bardet, Magali +3 more
core +6 more sources
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization [PDF]
, 2007 The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and ...
Benjamin Recht +4 more
core +3 more sources
Generalized decoding, effective channels, and simplified security proofs in quantum key distribution
, 2005 Prepare and measure quantum key distribution protocols can be decomposed into two basic steps: delivery of the signals over a quantum channel and distillation of a secret key from the signal and measurement records by classical processing and public ...
Grassl, Markus, Renes, Joseph M.
core +1 more source
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
, 2008 We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel.
Hehn, Thorsten +3 more
core +1 more source
Future InternetUltra-reliable and low-latency communication (URLLC) in 6G networks is characterized by very high reliability and very low latency to enable mission-critical applications.
Abhilasha Gautam +2 more
doaj +1 more source
Symmetry protected topological order at nonzero temperature [PDF]
, 2017 We address the question of whether symmetry-protected topological (SPT) order can persist at nonzero temperature, with a focus on understanding the thermal stability of several models studied in the theory of quantum computation. We present three results
Bartlett, Stephen D. +3 more
core +3 more sources
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff
, 2006 A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that can be ...
Elia, Petros +4 more
core +2 more sources