English
Related papers

Related papers: Arithmetic Operators over Finite Field GF($2^m$) f…

200 papers

Computer representations of three-dimensional (3D) geometries are crucial for simulating systems and processes in engineering and science. In medicine, and more specifically, biomechanics and orthopaedics, obtaining and using 3D geometries…

Quantitative Methods · Quantitative Biology 2024-04-05 Thor E. Andreassen , Donald R. Hume , Landon D. Hamilton , Sean E. Higinbotham , Kevin B. Shelburne

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

Information Theory · Computer Science 2018-07-30 Khawla Labad , Honwei Liu , Jinquan Luo

Sum-rank-metric codes have wide applications in the multishot network coding and the distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp type decoding algorithms were proposed and studied. They…

Information Theory · Computer Science 2024-04-05 Hao Chen , Yanfeng Qi , Zhiqiang Cheng

In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…

Number Theory · Mathematics 2017-07-04 Hau-Wen Huang , Wen-Ching Winnie Li

Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of…

Information Theory · Computer Science 2012-07-20 Shiva Kumar Planjery , Bane Vasic , David Declercq

We design polynomial size, constant depth (namely, $\mathsf{AC}^0$) arithmetic formulae for the greatest common divisor (GCD) of two polynomials, as well as the related problems of the discriminant, resultant, B\'ezout coefficients,…

Computational Complexity · Computer Science 2026-01-27 Robert Andrews , Avi Wigderson

Field Arithmetic studies the interplay between arithmetical properties of fields and their absolute Galois groups. Here we studies fields satisfying local global principles for rational points of varieties and profinite groups satisfying…

Number Theory · Mathematics 2007-05-23 Dan Haran , Moshe Jarden , Florian Pop

We construct optimal secure coded distributed schemes that extend the known optimal constructions over fields of characteristic 0 to all fields. A serendipitous result is that we can encode \emph{all} functions over finite fields with a…

Information Theory · Computer Science 2025-04-28 Pedro Soto

Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes -- a family of cyclic codes -- in practice. In theory, BCH…

Information Theory · Computer Science 2016-03-24 Cunsheng Ding , Cuiling Fan , Zhengchun Zhou

Decoding error-correctiong codes by methods of mathematical optimization, most importantly linear programming, has become an important alternative approach to both algebraic and iterative decoding methods since its introduction by Feldman…

Information Theory · Computer Science 2015-09-04 Michael Helmling

We study the arithmetic of division fields of semistable abelian varieties A over the rationals. The Galois group of the 2-division field of A is analyzed when the conductor is odd and squarefree. The irreducible semistable mod 2…

Number Theory · Mathematics 2011-02-23 Armand Brumer , Kenneth Kramer

Determining the exact decoding error probability of linear block codes is an interesting problem. For binary BCH codes, McEliece derived methods to estimate the error probability of a simple bounded distance decoding (BDD) for BCH codes.…

Information Theory · Computer Science 2026-01-29 Sisi Miao , Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we consider the collection of downloaded traces as a code and…

Information Theory · Computer Science 2023-05-08 Stanislav Kruglik , Gaojun Luo , Wilton Kim , Shubhransh Singhvi , Han Mao Kiah , San Ling , Huaxiong Wang

Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms as well as their theoretical importance. BCH codes form a subclass of cyclic codes and are very important in both theory and…

Information Theory · Computer Science 2016-08-09 Shuxing Li , Cunsheng Ding , Hao Liu

The problem of repairing linear codes and, in particular, Reed Solomon (RS) codes has attracted a lot of attention in recent years due to their extreme importance to distributed storage systems. In this problem, a failed code symbol (node)…

Information Theory · Computer Science 2022-04-12 Roni Con , Itzhak Tamo

The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies of algebraic soft-decision decoding with infinite cost are first studied…

Information Theory · Computer Science 2008-08-05 Jing Jiang , Krishna R. Narayanan

Function-correcting codes are designed to reduce redundancy of codes when protecting function values of information against errors. As generalizations of Hamming weights and Lee weights over $ \mathbb{Z}_{4} $, homogeneous weights are used…

Information Theory · Computer Science 2025-07-08 Huiying Liu , Hongwei Liu

Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…

Computational Geometry · Computer Science 2016-03-22 Michael J. Bannister , William E. Devanny , David Eppstein , Michael T. Goodrich

This paper investigates simple means of analyzing the error rate performance of a general q-ary Galois Field network coded detect-and-forward cooperative relay network with known relay error statistics at the destination. Equivalent relay…

Information Theory · Computer Science 2024-10-30 Ilgın Şafak , Emre Aktaş , Ali Özgür Yılmaz

Entanglement-assisted quantum error correcting codes (EAQECCs) constructed from Reed-Solomon codes and BCH codes are considered in this work. It is provided a complete and explicit formula for the parameters of EAQECCs coming from any…

Information Theory · Computer Science 2022-08-25 Carlos Galindo , Fernando Hernando , Diego Ruano