English
Related papers

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

200 papers

Two new qubit stabilizer codes with parameters $[77, 0, 19]_2$ and $[90, 0, 22]_2$ are constructed for the first time by employing additive symplectic self-dual $\F_4$ codes from multidimensional circulant (MDC) graphs. We completely…

Information Theory · Computer Science 2023-09-06 Padmapani Seneviratne , Hannah Cuff , Alexandra Koletsos , Kerry Seekamp , Adrian Thnanopavarn

The research of developing a general methodology for the construction of good nonregular designs has been very active in the last decade. Recent research by Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of…

Statistics Theory · Mathematics 2009-08-25 Frederick K. H. Phoa , Hongquan Xu

In this paper we prove a result on the structure of the elements of an additive {\it maximum rank distance (MRD) code} over the field of order two, namely that in some cases such codes must contain a semifield spread set. We use this result…

Combinatorics · Mathematics 2018-08-28 John Sheekey

An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are important because they admit analytical designs and simple, practical hardware implementation. The spread factor of an…

Information Theory · Computer Science 2016-11-17 Oscar Y. Takeshita

In this work, we study the DNA codes from the ring R = Z4 + wZ4, where w^2 = 2+2w with 16 elements. We establish a one to one correspondence between the elements of the ring R and all the DNA codewords of length 2 by defining a…

Information Theory · Computer Science 2018-01-10 Dixita Limbachiya , Krishna Gopal , Bansari Rao , Manish K. Gupta

We carried out photometric and low-resolution spectral observations of six eclipsing ultrashort-period binaries with MS components. The light curve solutions of the Rozhen observations show that all targets are overcontact systems. We found…

Solar and Stellar Astrophysics · Physics 2015-06-23 Dinko Dimitrov , Diana Kjurkchieva

In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base $2$ expansion of the integers in their defining…

Information Theory · Computer Science 2023-09-22 Minjia Shi , Sihui Tao , Jon-Lark Kim , Patrick Sole

Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise. Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and…

Quantum Physics · Physics 2025-08-06 György P. Gehér , David Byfield , Archibald Ruban

RNA secondary structure prediction is widely used to understand RNA function. Recently, there has been a shift away from the classical minimum free energy (MFE) methods to partition function-based methods that account for folding ensembles…

Biomolecules · Quantitative Biology 2024-02-08 He Zhang , Liang Zhang , David H. Mathews , Liang Huang

We constrain the orbital period ($P_{\rm orb}$) distribution of low-mass detached main-sequence eclipsing binaries (EBs) with light curves from the Zwicky Transient Facility (ZTF), which provides a well-understood selection function and…

Solar and Stellar Astrophysics · Physics 2022-10-26 Kareem El-Badry , Charlie Conroy , Jim Fuller , Rocio Kiman , Jan van Roestel , Antonio C. Rodriguez , Kevin B. Burdge

In [C. Ding, An infinite family of Steiner systems $S(2,4,2^m)$ from cyclic codes, {\em J. Combin. Des.} 26 (2018), no.3, 126--144], Ding constructed a family of Steiner systems $S(2,4,2^m)$ for all $m \equiv 2 \pmod{4}$ from a family of…

Combinatorics · Mathematics 2024-02-27 Qi Wang

Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient…

Information Theory · Computer Science 2015-03-13 Lucian Trifina , Daniela Tarniceriu

We consider the weight spectrum of a class of quasi-perfect binary linear codes with code distance 4. For example, extended Hamming code and Panchenko code are the known members of this class. Also, it is known that in many cases Panchenko…

Information Theory · Computer Science 2017-06-13 Valentine B. Afanassiev , Alexander A. Davydov

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F_4 + uF_4 as well as F_4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension…

Combinatorics · Mathematics 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

Next-generation channel coding has stringent demands on throughput, energy consumption, and error rate performance while maintaining key features of 5G New Radio (NR) standard codes such as rate compatibility, which is a significant…

Information Theory · Computer Science 2025-05-29 Yuqing Ren , Leyu Zhang , Yifei Shen , Wenqing Song , Emmanuel Boutillon , Alexios Balatsoukas-Stimming , Andreas Burg

Z2Z4-additive codes have been defined as a subgroup of Z2^{r} x Z4^{s} in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set…

Information Theory · Computer Science 2017-11-07 Ismail Aydogdu , Fatmanur Gursoy

Short packets make channel learning expensive. In pilot-aided transmission (PAT), a non-negligible fraction of the packet is consumed by pilots, creating a direct pre-log loss and tightening the reliability margin needed for ultra-reliable…

Signal Processing · Electrical Eng. & Systems 2026-02-23 Geon Choi , Namyoon Lee

Since near maximum distance separable (NMDS) codes have good algebraic properties and excellent error-correcting capabilities, they have been widely used in various fields such as communication systems, data storage, quantum codes, and so…

Information Theory · Computer Science 2025-06-25 Zhonghao Liang , Qunying Liao