搜索结果: 1-15 共查到“信息科学与系统科学 Codes”相关记录28条 . 查询时间(0.031 秒)
Quasi-Orthogonal Space-Time-Frequency Trellis Codes for MIMO-OFDM Systems
MIMO-OFDM receive diversity quasi-orthogonal designs trellis codes space-time-frequency codes
2012/7/9
The main objective of this project is to design the full-rate Space-Time-Frequency Trellis code (STFTC), which is based on Quasi-Orthogonal designs for Multiple-Input Multiple-Output (MIMO) Orthogonal...
Making WOM Codes Decodable Using Short Synchronous WOM Codes
Making WOM Codes Decodable Short Synchronous WOM Codes Information Theory
2012/6/21
While some write once memory (WOM) codes are inherently decodable, others require the added knowledge of the current generation in order to successfully decode the state of the memory. If there is no ...
We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\i}kan. In the proposed list decoder, up to $L...
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the lis...
Asymptotically good binary linear codes with asymptotically good self-intersection spans
Asymptotically good binary linear codes asymptotically good self-intersection spans Information Theory
2012/4/16
If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging...
Implementation Of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs
Implementation Of Decoders LDPC Block Codes LDPC Convolutional Codes GPUs
2012/4/17
With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. LDPC codes can accomplish bit error rates (BERs) as low as...
Unique Decoding of Plane AG Codes Revisited
Unique Decoding Plane AG Codes Revisited Information Theory
2012/4/17
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. ...
Codes as fractals and noncommutative spaces
noncommutative spaces Codes Information Theory
2011/9/22
Abstract: We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can asso...
Perfect Codes for Uniform Chains Poset Metrics
Disjoint uniform chains perfect codes poset codes
2011/9/22
Abstract: The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same siz...
An Algebraic Approach for Decoding Spread Codes
Algebraic Approach Spread Codes Information Theory
2011/9/22
Abstract: We present a family of constant-dimension codes for random linear network coding called spread codes. This is a family of optimal codes with maximum minimum distance. A spread code is constr...
Abstract: In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme...
Information-theoretically Secure Regenerating Codes for Distributed Storage
Information-theoretically Secure Regenerating Codes Distributed Storage
2011/9/21
Abstract: Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect o...
Multilevel polarization for nonbinary codes and parallel channels
Polar codes nonbinary channels parallel channels
2011/9/20
Abstract: We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's successive cancellation decoding, we prove that the virtual channels that arise in the...
Threshold Improvement of Low-Density Lattice Codes via Spatial Coupling
Low-Density Lattice Codes Spatial Coupling Information Theory
2011/9/20
Abstract: Spatially-coupled low-density lattice codes (LDLC) are constructed using protographs. Using Monte Carlo density evolution using single-Gaussian messages, we observe that the threshold of the...
Abstract: This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. ...