English
Related papers

Related papers: Hulls of Projective Reed-Muller Codes

200 papers

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a…

Information Theory · Computer Science 2020-06-02 Weijun Fang , Shu-Tao Xia , Fang-Wei Fu

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing $x^n-\lambda$ over $\mathbb{F}_{q^2}$ is given, where $\lambda$ is a unit in $\mathbb{F}_{q^2}$. Based on this…

Rings and Algebras · Mathematics 2016-01-05 Ekkasit Sangwisut , Somphong Jitman , Patanee Udomkavanich

Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance. However, their practical instantiation encounters a first barrier due to…

Information Theory · Computer Science 2019-04-19 Julien Lavauzelle , Jade Nardi

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

Combinatorics · Mathematics 2014-11-25 Martino Borello , Gabriele Nebe

Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…

Information Theory · Computer Science 2021-03-26 Ziling Heng , Dexiang Li , Jiao Du , Fuling Chen

This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this…

Information Theory · Computer Science 2015-06-16 Santhosh Kumar , Henry D. Pfister

The Euclidean hull of a linear code $C$ is defined as $C\cap C^{\perp}$, where $C^\perp$ denotes the dual of $C$ under the Euclidean inner product. A linear code with zero hull dimension is called a linear complementary dual (LCD) code. A…

Information Theory · Computer Science 2023-04-25 Zohreh Aliabadi , Tekgül Kalaycı

In this paper, by using some properties for linear algebra methods, the parity-check matrices for twisted generalized Reed-Solomon codes with any given hook $h$ and twist $t$ are presented, and then a sufficient and necessary condition for…

Information Theory · Computer Science 2022-09-07 Canze Zhu , Qunying Liao

Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more generally, affine Grassmann codes of a given level.…

Information Theory · Computer Science 2012-06-07 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple…

Information Theory · Computer Science 2019-05-13 Ronald Cramer , Chaoping Xing , Chen Yuan

The hulls of linear and cyclic codes over finite fields have been of interest and extensively studied due to their wide applications. In this paper, the hulls of cyclic codes of length $n$ over the ring $\mathbb{Z}_4$ have been focused on.…

Information Theory · Computer Science 2019-02-28 Somphong Jitman , Ekkasit Sangwisut , Patanee Udomkavanich

This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle \kappa,\tau \mid 2 \kappa =2 \tau=0,~ \kappa^2=\kappa,~ \tau^2=\tau,~ \kappa \tau=\kappa,~ \tau \kappa=\tau \rangle$. Initially, we examine the…

Information Theory · Computer Science 2025-12-30 Anup Kushwaha , Om Prakash

In this paper, we study the problem of constructing projective systematic authentication schemes based on binary linear codes. In systematic authentication, a tag for authentication is generated and then appended to the information, also…

Cryptography and Security · Computer Science 2024-04-16 Hsuan-Po Liu , Hessam Mahdavifar

In this note, a general result for determining the rational hulls of fibered sets in $\mathbb{C}^2$ is established. We use this to compute the rational hull of Rudin's Klein bottle, the first explicit example of a totally real nonorientable…

Complex Variables · Mathematics 2018-12-20 John T. Anderson , Purvi Gupta , Edgar L. Stout

We present a characterization, in terms of projective biduality, for the hypersurfaces appearing in the boundary of the convex hull of a compact real algebraic variety.

Algebraic Geometry · Mathematics 2010-07-02 Kristian Ranestad , Bernd Sturmfels

Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a…

Information Theory · Computer Science 2021-08-03 Xiaolei Fang , Renjie Jin , Jinquan Luo , Wen Ma

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…

Information Theory · Computer Science 2024-01-03 Astha Agrawal , R. K. Sharma

The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…

Information Theory · Computer Science 2022-09-20 Yang Li , Shixin Zhu , Pi Li

In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…

Information Theory · Computer Science 2025-01-29 Puyin Wang , Jinquan Luo

We investigate the notion of the C-projective dimension of a module, where C is a semidualizing module. When C=R, this recovers the standard projective dimension. We show that three natural definitions of finite C-projective dimension…

Commutative Algebra · Mathematics 2008-08-05 Ryo Takahashi , Diana White
‹ Prev 1 4 5 6 7 8 10 Next ›