English
Related papers

Related papers: Weighted Hamming Metric Structures

200 papers

We address an open problem posed by Chen-Cheng-Qi (IEEE Trans.\ Inf.\ Theory, 2025): can the decoding of binary sum-rank-metric codes $\SR(C_1,C_2)$ with $2\times2$ matrix blocks be reduced entirely to decoding the constituent…

Information Theory · Computer Science 2026-03-31 Hao Wu , Bocong Chen , Guanghui Zhang , Hongwei Liu

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…

Information Theory · Computer Science 2009-09-29 Gérard Cohen , Alexander Vardy

We provide a geometric characterization of $k$-dimensional $\mathbb{F}_{q^m}$-linear sum-rank metric codes as tuples of $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We then use this characterization to study one-weight codes in the…

Information Theory · Computer Science 2021-12-10 Alessandro Neri , Paolo Santonastaso , Ferdinando Zullo

Studying binary perfect codes we show the existence of homogeneous nontransitive codes. Thus, as far as perfect codes are concerned, the propelinear codes are strictly contained in transitive codes, wheresas homogeneous codes form a strict…

Combinatorics · Mathematics 2014-12-10 I. Yu. Mogilnykh , F. I. Solov'eva

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

Data Structures and Algorithms · Computer Science 2019-01-24 Xinyang Yi , Constantine Caramanis , Eric Price

Delsarte showed that for any projective linear code over a finite field of characteristic p with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = (p^s)u and w2 = (p^s)(u+1). Moreover, he showed that…

Combinatorics · Mathematics 2015-10-16 Eimear Byrne , Michael Kiermaier , Alison Sneyd

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…

Information Theory · Computer Science 2013-10-22 Muhammad Ilyas , Mieko Yamada

Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…

Rings and Algebras · Mathematics 2018-11-06 Yuval Ginosar , Aviram Rochas Moreno

We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting…

Information Theory · Computer Science 2011-08-16 Qiwen Wang , Sidharth Jaggi , Shuo-Yen Robert Li

Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…

Information Theory · Computer Science 2018-11-15 Martino Borello , Olivier Mila

We develop a theory of completeness for weight structures on stable categories, dual to the theory of complete t-structures. As in the bounded case, we show that complete weight structures are determined by their weight heart, giving rise…

Algebraic Topology · Mathematics 2026-05-04 Thomas Nikolaus , Phil Pützstück

There is growing interest in representing image data and feature descriptors using compact binary codes for fast near neighbor search. Although binary codes are motivated by their use as direct indices (addresses) into a hash table, codes…

Computer Vision and Pattern Recognition · Computer Science 2014-04-28 Mohammad Norouzi , Ali Punjani , David J. Fleet

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\Gamma$ is a subset $C$ of $V$ such…

Combinatorics · Mathematics 2017-03-28 Rongquan Feng , He Huang , Sanming Zhou

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…

Combinatorics · Mathematics 2017-10-24 Relinde Jurrius

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. Fundamental bounds, some explicit or…

Information Theory · Computer Science 2023-12-27 Hao Chen

We give explicit structure of the graded ring of modular forms with respect to Gamma(N) (N=1,2,3,4,5,6,7,8,9,10,12,16,18) and for some other congruence groups. We also study the modular forms of half-integer weight for certain groups.

Number Theory · Mathematics 2019-04-10 Suda Tomohiko

This article provides some basic results on weight structures, weight complex functors and homotopy categories. We prove that the full subcategories K(A)^{w < n}, K(A)^{w > n}, K(A)^- and K(A)^+ (of objects isomorphic to suitably bounded…

Category Theory · Mathematics 2011-07-07 Olaf M. Schnürer

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