English
Related papers

Related papers: On the second Hamming weight of some Reed-Muller t…

200 papers

Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…

Information Theory · Computer Science 2015-06-12 Yeow Meng Chee , Han Mao Kiah , Punarbasu Purkayastha , Patrick Solé

This is a survey on the theory of adaptive finite element methods (AFEMs), which are fundamental in modern computational science and engineering but whose mathematical assessment is a formidable challenge. We present a self-contained and…

Numerical Analysis · Mathematics 2024-11-20 Andrea Bonito , Claudio Canuto , Ricardo H. Nochetto , Andreas Veeser

We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…

Information Theory · Computer Science 2026-01-16 Vlad-Florin Dragoi , Mohammad Rowshan

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2021-11-23 Haibo Liu Qunying Liao , Canze Zhu

This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…

Information Theory · Computer Science 2017-07-05 Martino Borello , Olivier Mila

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Information Theory · Computer Science 2025-01-22 Zhao Hu , Mingxiu Qiu , Nian Li , Xiaohu Tang , Liwei Wu

Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller codes, which they contain as subcodes. This work introduces a…

Information Theory · Computer Science 2021-04-22 Lukas Holzbaur , Nikita Polyanskii

In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…

Information Theory · Computer Science 2025-12-17 Xiumei Li , Xiaotong Sun , Min Sha

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

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole

We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of…

Information Theory · Computer Science 2026-02-27 Rodrigo San-José

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

Optimization and Control · Mathematics 2013-12-16 Mehdi Ghasemi , Jean Bernard Lasserre , Murray Marshall

Recursive list decoding of Reed-Muller (RM) codes, with moderate list size, is known to approach maximum-likelihood (ML) performance of short length $(\leq 256)$ RM codes. Recursive decoding employs the Plotkin construction to split the…

Information Theory · Computer Science 2022-07-20 Mikhail Kamenev

Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double…

Combinatorics · Mathematics 2026-03-24 Masaaki Harada , Keito Yamaguchi

One of the most appealing results of metric-affine gauge theory of gravity is a close parallel between the Riemann curvature two-form and the Cartan torsion two-form: While the former is the field strength of the Lorentz-group connection…

General Relativity and Quantum Cosmology · Physics 2021-07-15 Bo-Hung Chen , Dah-Wei Chiou

We give a presentation of localized affine and degenerate affine Hecke algebras of arbitrary type in terms of weights of the polynomial subalgebra and varied Demazure-BGG type operators. We offer a definition of a graded algebra…

Representation Theory · Mathematics 2014-11-21 Robert Denomme

We determine properties of two-dimensional normal affine semigroup rings, and in particular of weighted Veronese rings, including determinantal presentation, Gr\"obner basis, graded Hilbert series and graded Betti numbers, the structure of…

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…

Information Theory · Computer Science 2015-11-04 Olav Geil , Stefano Martin

We give a bijection between certain colored partitions and the elements in the quotient of an affine Weyl group modulo its Weyl group. By Bott's formula these colored partitions give rise to some partition identities. In certain types,…

Combinatorics · Mathematics 2008-09-28 Sara C. Billey , Stephen A. Mitchell
‹ Prev 1 8 9 10 Next ›