English
Related papers

Related papers: Three new classes of optimal frequency-hopping seq…

200 papers

Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…

Information Theory · Computer Science 2025-12-01 Jinmei Fan , Jingyao Feng , Yuhan Men , Yanhai Zhang

Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete complementary codes…

Information Theory · Computer Science 2024-01-12 Palash Sarkar , Chunlei Li , Sudhan Majhi , Zilong Liu

A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…

Information Theory · Computer Science 2007-07-13 Oscar Y. Takeshita

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…

Functional Analysis · Mathematics 2019-08-02 Ivan Feshchenko

A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…

Information Theory · Computer Science 2012-03-13 Alexander Zeh , Antonia Wachter , Sergey Bezzateev

This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties.…

Information Theory · Computer Science 2017-11-10 Hsuan-Yin Lin , Stefan M. Moser , Po-Ning Chen

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

Information Theory · Computer Science 2019-09-04 Yuri I. Manin , Matilde Marcolli

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to…

Information Theory · Computer Science 2013-05-02 Cunsheng Ding , Tor Helleseth

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…

Information Theory · Computer Science 2025-04-17 Xiaoqiang Wang , Liuyi Li , Yansheng Wu , Dabin Zheng , Shuxian Lu

Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied,…

Information Theory · Computer Science 2011-10-10 Denis S. Krotov , Patric R. J. Östergård , Olli Pottonen

In a frequency hopping (FH) scheme users communicate simultaneously using FH sequences defined on the same set of frequency channels. An FH sequence specifies the frequency channel to be used as communication progresses. Much of the…

Information Theory · Computer Science 2018-07-27 Mwawi M. Nyirenda , Siaw-Lynn Ng , Keith M. Martin

Recently, the theory of quantum error control codes has been extended to subsystem codes over symmetric and asymmetric quantum channels -- qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in…

Quantum Physics · Physics 2008-11-11 Salah A. Aly

This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…

Information Theory · Computer Science 2021-02-18 Whan-Hyuk Choi , Jon-Lark Kim

In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on…

Information Theory · Computer Science 2021-02-02 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…

Information Theory · Computer Science 2021-12-30 Jonathan M. Castello , Daniel J. Katz , Jacob M. King , Alain Olavarrieta

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-06-12 Dong He , Peipei Zheng , Qunying Liao

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…

Information Theory · Computer Science 2023-02-23 Gobinda Ghosh , Sudhan Majhi , Shubabrata Paul

Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…

Information Theory · Computer Science 2026-02-19 Chao Liu , Hao Chen , Qinqin Ji , Ziyan Xie , Dabin Zheng , Yongbo Xia

Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…

Information Theory · Computer Science 2024-08-06 Xianhong Xie , Yaxin Zhao , Zhonghua Sun , Xiaobo Zhou

Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs and the constructions of optimal MCWCs are studied. Firstly,…

Information Theory · Computer Science 2015-12-29 Xin Wang , Hengjia Wei , Chong Shangguan , Gennian Ge
‹ Prev 1 3 4 5 6 7 10 Next ›