English
Related papers

Related papers: Quaternary and Component-Binary Spreading Codes wi…

200 papers

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible…

Information Theory · Computer Science 2016-08-10 Shuxing Li , Gennian Ge

Quantum key distribution (QKD) leverages the principles of quantum mechanics to exchange a secret key between two parties. Despite its promising features, QKD also faces several practical challenges such as transmission loss, noise in…

The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois…

Information Theory · Computer Science 2022-05-25 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek

Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Camilla Hollanti , Frédérique Oggier

The predicted orbital-period distribution of the subdwarf-B (sdB) population is bi-modal with a peak at short (< 10 days) and long (> 500 days) periods. Observationally, many short-period sdB systems are known, but only few wide sdB…

Solar and Stellar Astrophysics · Physics 2017-09-20 Joris Vos , Roy H. Østensen , Maja Vuckovic , Hans Van Winckel

Let $F_2$ be the binary field and $Z_{2^r}$ the residue class ring of integers modulo $2^r$, where $r$ is a positive integer. For the finite $16$-element commutative local Frobenius non-chain ring $Z_4+uZ_4$, where $u$ is nilpotent of index…

Information Theory · Computer Science 2017-11-22 Virgilio P. Sison , Monica N. Remillion

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

Information Theory · Computer Science 2012-06-08 Elisa Gorla , Felice Manganiello , Joachim Rosenthal

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we…

Information Theory · Computer Science 2022-03-24 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

Global Navigation Satellite Systems (GNSS) employ inter-satellite links (ISLs) to reduce dependency on ground stations, enabling precise ranging and communication across satellites. Beyond their traditional role, ISLs can support extended…

Systems and Control · Electrical Eng. & Systems 2026-01-28 Huan Yan , Juan A. Fraire , Ziqi Yang , Kanglian Zhao , Wenfeng Li , Xiyun Hou , Haohan Li , Yuxuan Miao , Jinjun Zheng , Chengbin Kang , Huichao Zhou , Xinuo Chang , Lu Wang

A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear…

Information Theory · Computer Science 2007-10-08 J. Borges , C. Fernandez , J. Pujol , J. Rifa , M. Villanueva

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The…

Information Theory · Computer Science 2015-05-20 Hironori Uchikawa , Kenta Kasai , Kohichi Sakaniwa

Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…

Information Theory · Computer Science 2021-05-05 Anirban Ghatak , Sumanta Mukherjee

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan

This paper proposes a novel design of multi-symbol unitary constellation for non-coherent single-input multiple-output (SIMO) communications over block Rayleigh fading channels. To facilitate the design and the detection of large unitary…

Information Theory · Computer Science 2023-11-08 Son T. Duong , Ha H. Nguyen , Ebrahim Bedeer , Robert Barton

An $[n, k, n-k+1]$ linear code is called an MDS code. An $[n, k, n-k]$ linear code is said to be almost maximum distance separable (almost MDS or AMDS for short). A code is said to be near maximum distance separable (near MDS or NMDS for…

Information Theory · Computer Science 2019-12-17 Cunsheng Ding , Chunming Tang

Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda…

Information Theory · Computer Science 2024-02-16 Hao Chen

A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable)…

Information Theory · Computer Science 2020-08-04 Qiuyan Wang , Ziling Heng

This paper proposes a new coded modulation scheme for reliable transmission of short data packets at very low signal-to-noise ratio, combining cyclic code shift keying modulation and non-binary polar coding. We consider non-binary polar…

Information Theory · Computer Science 2022-04-07 Valentin Savin

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the…

Information Theory · Computer Science 2007-07-13 G. Susinder Rajan , Anshoo Tandon , B. Sundar Rajan

We construct error correcting codes for jointly transmitting a finite set of independent messages to an 'informed receiver' which has prior knowledge of the values of some subset of the messages as side information. The transmitter is…

Information Theory · Computer Science 2016-04-08 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo