English
Related papers

Related papers: Optimal Binary $(5,3)$ Projective Space Codes from…

200 papers

Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…

Metric Geometry · Mathematics 2013-06-25 Henry Cohn , Jeechul Woo

The design of binary error-correcting codes is a challenging optimization problem with several applications in telecommunications and storage, which has also been addressed with metaheuristic techniques and evolutionary algorithms. Still,…

Neural and Evolutionary Computing · Computer Science 2022-11-22 Claude Carlet , Luca Mariot , Luca Manzoni , Stjepan Picek

If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k+3)-dimensional binary hypercube, there exists a mobile set of cardinality 2*6^k that cannot be split into mobile sets of smaller…

Combinatorics · Mathematics 2008-08-06 Yuriy Vasil'ev , Sergey Avgustinovich , Denis Krotov

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

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…

Information Theory · Computer Science 2019-08-09 Yan Liu , Xiwang Cao

The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel.…

Information Theory · Computer Science 2011-05-02 Yashodhan Kanoria , Andrea Montanari

Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…

Information Theory · Computer Science 2025-09-15 Mengen Fang , Lanqiang Li , Fuyin Tian , Li Liu

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…

Information Theory · Computer Science 2017-07-17 Bocong Chen , Hongwei Liu

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary low-density parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented,…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

After the optimal parameters of additive quaternary codes of dimension $k\le 3$ have been determined there is some recent activity to settle the next case of dimension $k=3.5$. Here we complete dimension $k=3.5$ and $k=4$. We also solve the…

Combinatorics · Mathematics 2026-05-11 Sascha Kurz

R. W. Hamming published the Hamming codes and the sphere packing bound in 1950. In the past 75 years, infinite families of distance-optimal linear codes over finite fields with minimum distance at most 8 with respect to the sphere packing…

Information Theory · Computer Science 2025-10-28 Hao Chen , Conghui Xie , Cunsheng Ding

In this paper, we further investigate the constructions on three-dimensional $(u\times v\times w,k,1)$ optical orthogonal codes with the at most one optical pulse per wavelength/time plane restriction (briefly AM-OPP $3$-D $(u\times v\times…

Information Theory · Computer Science 2016-02-26 Lidong Wang , Yanxun Chang

As an important coding scheme in modern distributed storage systems, locally repairable codes (LRCs) have attracted a lot of attentions from perspectives of both practical applications and theoretical research. As a major topic in the…

Information Theory · Computer Science 2021-01-01 Xiangliang Kong , Xin Wang , Gennnian Ge

Constellation shaping is a practical and effective technique to improve the performance and the rate adaptivity of optical communication systems. In principle, it could also be used to mitigate the impact of nonlinear effects, possibly…

Information Theory · Computer Science 2022-06-08 Marco Secondini , Stella Civelli , Enrico Forestieri , Lareb Zar Khan

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

Combinatorics · Mathematics 2018-12-17 Thomas Honold , Michael Kiermaier , Sascha Kurz

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Information Theory · Computer Science 2021-07-12 Gerardo Vega , Félix Hernández

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be…

Information Theory · Computer Science 2022-08-31 Gaofei Wu , Huan Liu , Yuqing Zhang

In this paper, we introduce the notion of perfect space-time block codes (STBC). These codes have full rate, full diversity, non-vanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy…

Information Theory · Computer Science 2007-07-16 F. Oggier , G. Rekaya-Ben Othman , J. -C. Belfiore , E. Viterbo

Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give…

Information Theory · Computer Science 2020-10-12 Tingting Chen , Yiming Ma , Xiande Zhang