相关论文: Space Time Codes from Permutation Codes

We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of…

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…

We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a…

As wireless communication systems look intently to compose the transition from voice communication to interactive Internet data, achieving higher bit rates becomes both increasingly desirable and challenging. Space-time coding (STC) is a…

Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper…

Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…

Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…

We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…

In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…

A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we…

We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the…

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…

New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…

Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations of $n$…

Just as rank-metric or Gabidulin codes may be used to construct rate-diversity tradeoff optimal space-time codes, a recently introduced generalization for the sum-rank metric -- linearized Reed-Solomon codes -- accomplishes the same in the…

In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, the data to be transmitted may lie (or can be well approximated) in a…

Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block…