Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2 Z4 -additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain families of Z2 Z4 -additive codes such that, under the Gray map, the corresponding binary codes have the same parameters and properties as the usual binary linear Reed-Muller codes. Moreover, the first family is the usual binary linear Reed-Muller family.

• Publication year

  2009

• Venue

  Lecture Notes in Computer Science

• Publication date

  2009-01-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-02181-7arXiv 0909.3185
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Further improvements on the designed minimum distance of algebraic geometry codes

  2009cited by this paper
• Coset bounds for algebraic geometric codes

  2008influential reference
• Algebraic geometry codes: general theory

  2008cited by this paper
• The order bound for general algebraic geometric codes

  2007influential reference
• On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes

  2006cited by this paper
• A generalization of the Weierstrass semigroup

  2006cited by this paper
• On the floor and the ceiling of a divisor

  2006cited by this paper
• Algebraic Geometry Codes

  2005cited by this paper
• On Goppa Codes and Weierstrass Gaps at Several Points

  2005cited by this paper
• Codes from the Suzuki function field

  2004cited by this paper
• A GENERALIZED FLOOR BOUND FOR THE MINIMUM DISTANCE OF GEOMETRIC GOPPA CODES AND ITS APPLICATION TO TWO-POINT CODES

  2004cited by this paper
• Geometric Reed-Solomon codes of length 64 and 65 over F8

  2003cited by this paper
• Weierstrass Pairs and Minimum Distance of Goppa Codes

  2001cited by this paper
• On the parameters of algebraic-geometry codes related to Arf semigroups

  1999cited by this paper
• A characterization of 1-perfect additive codes

  1999cited by this paper
• The minimum distance of codes in an array coming from telescopic semigroups

  1995cited by this paper
• On the index of the Weierstrass semigroup of a pair of points on a curve

  1994cited by this paper
• Decoding algebraic-geometric codes up to the designed minimum distance

  1993cited by this paper
• Majority coset decoding

  1993cited by this paper
• Group codes on certain algebraic curves with many rational points

  1990cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper

• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation

  2023cites this paper
• From dual-unitary to biunitary: a 2-categorical model for exactly-solvable many-body quantum dynamics

  2023cites this paper
• BPCPR-FC: blockchain-based privacy preservation with confidentiality using proxy reencryption and ring signature in fog computing environments

  2023cites this paper
• MacWilliams' Extension Theorem for rank-metric codes

  2023cites this paper
• A Parallel Strategy for Solving Sparse Linear Systems Over Finite Fields

  2022cites this paper
• Resiliency and Nonlinearity Profiles of Some Cryptographic Functions

  2022cites this paper
• New invariants of Gromov–Hausdorff limits of Riemannian surfaces with curvature bounded below

  2022cites this paper
• Constructing Functions with Low Differential Uniformity

  2022cites this paper
• Degröbnerization: a political manifesto

  2022cites this paper
• On pure (cid:2) -sparse gapsets

  2022cites this paper
• Efficient ASIC Architectures for Low Latency Niederreiter Decryption

  2022cites this paper
• Complete stability assessment of LTI systems with multiple constant-coefficient distributed delays using the improved frequency sweeping framework

  2022cites this paper
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum

  2022cites this paper
• n-Dimensional quasi-cyclic codes over finite chain rings

  2022cites this paper
• A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System

  2022cites this paper
• Victor Timofeevich Markov (21.06.1948–15.07.2019)

  2022cites this paper
• AG codes from $${{\mathbb{F}}_{q^7}}$$ F q 7 -rational points of t

  2021cites this paper
• On Search Complexity of Discrete Logarithm

  2021cites this paper
• Hardness of Motion Planning with Obstacle Uncertainty in Two Dimensions

  2021cites this paper
• Yet another eigenvalue algorithm for solving polynomial systems

  2021cites this paper
• On Pure k-sparse gapsets

  2021cites this paper
• Improved frequency sweeping technique and stability analysis of the second-order consensus protocol with distributed delays

  2021cites this paper
• Accelerating XOR-Based Erasure Coding using Program Optimization Techniques

  2021cites this paper
• From primary to dual affine variety codes over the Klein quartic

  2021cites this paper
• High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications

  2021cites this paper
• Optimal Fine-grained Hardness of Approximation of Linear Equations

  2021cites this paper
• Une généralisation du critère de Boulier–Buchberger pour le calcul des ensembles caractéristiques d’idéaux différentiels

  2021cites this paper
• A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks

  2021cites this paper
• Efficient product formulas for commutators and applications to quantum simulation

  2021cites this paper
• Goppa codes over Edwards curves

  2021cites this paper
• Project-Team tanc Théorie algorithmique des nombres pour la cryptologie

  2021cites this paper
• Homotopy techniques for solving sparse column support determinantal polynomial systems

  2020cites this paper
• Toric Eigenvalue Methods for Solving Sparse Polynomial Systems

  2020cites this paper
• Looking at the NIST Lightweight Candidates from a Masking Point-of-View

  2020cites this paper
• Algebraic and Logic Solving Methods for Cryptanalysis

  2020cites this paper
• Partition Identities and Application to Infinite-Dimensional Gröbner Basis and Vice Versa

  2020cites this paper
• Low AND Depth and Efficient Inverses: a Guide on S-boxes for Low-latency Masking

  2020cites this paper
• Multiparty Cardinality Testing for Threshold Private Set Intersection

  2020cites this paper
• Steane-enlargement of quantum codes from the Hermitian function field

  2020cites this paper
• Constructible sheaves and functions up to infinity

  2020cites this paper
• LINEAR COMPLEXITY OF GENERALIZED CYCLOTOMIC BINARY SEQUENCES OF PERIOD pq

  2020cites this paper
• Smooth points on semi-algebraic sets

  2020cites this paper
• Finding the Covering radius of codes over Z 3 2 by assigning Homogeneous weight

  2020cites this paper
• Toric Surfaces, Linear and Quantum Codes Secret Sharing and Decoding

  2019cites this paper
• Arithmetic Graphs and Classes of Finite Groups

  2019cites this paper
• On multivariate polynomials with many roots over a finite grid

  2019cites this paper
• On Steane-enlargement of quantum codes from Cartesian product point sets

  2019cites this paper
• High-order regularised symplectic integrator for collisional planetary systems

  2019cites this paper
• Steane-enlargement of quantum codes from the Hermitian function field

  2019cites this paper
• High dimensional affine codes whose square has a designed minimum distance

  2019cites this paper
• Computation of Minimum Hamming Weight for Linear Codes

  2019cites this paper
• On degree-d zero-sum sets of full rank

  2019cites this paper
• Minimal linear codes constructed from functions

  2019cites this paper
• Securing NEMO Using a Bilinear Pairing-Based 3-Party Key Exchange (3PKE-NEMO) in Heterogeneous Networks

  2019cites this paper
• Optimized Method for Computing Odd-Degree Isogenies on Edwards Curves

  2019cites this paper
• One-way quantum repeaters with quantum Reed-Solomon codes

  2018cites this paper
• Enriched categories of correspondences and characteristic classes of singular varieties

  2018cites this paper
• Accelerating Vertex Cover Optimization on a GPU Architecture

  2018cites this paper
• Irredundant Triangular Decomposition

  2018cites this paper
• Persistent homology and Euler integral transforms

  2018cites this paper
• How Many Directions Determine a Shape and other Sufficiency Results for Two Topological Transforms

  2018cites this paper
• Lifted projective Reed–Solomon codes

  2018cites this paper
• Hadamard full propelinear codes with associated group $C_{2t}\times C_2$; rank and kernel

  2018cites this paper
• Analysis of burn-in period for RC4 state transition

  2018cites this paper
• Existence of a unique quasi-stationary distribution in stochastic reaction networks

  2018cites this paper
• Holographic codes on Bruhat–Tits buildings and Drinfeld symmetric spaces

  2018cites this paper
• On codes over and its covering radius for Lee weight and Homogeneous weight

  2018cites this paper
• Formal methods for systems of partial differential equations

  2018cites this paper
• A tree search algorithm for low multiplicative complexity logic design

  2018cites this paper
• On Functional Graphs of Quadratic Polynomials

  2017cites this paper
• Optimizing curve-based cryptography

  2017cites this paper
• Toric Codes, Multiplicative Structure and Decoding

  2017cites this paper
• Hadamard full propelinear codes of type Q; rank and kernel

  2017cites this paper
• New generalized cyclotomic binary sequences of period p2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p^2$$\end{docu

  2017cites this paper
• Persistent Homology and Nested Dissection

  2016cites this paper
• Improved Distance Queries and Cycle Counting by Frobenius Normal Form

  2016cites this paper
• COMPREHENSIVE STUDY ON KEY MANAGEMENT SCHEMES IN MANET

  2016cites this paper
• On quantum tensor product codes

  2016cites this paper
• Differentiability of imaginary spectra and determination of its bounds for multiple-delay LTI systems

  2016cites this paper
• Mastering Marketing Management

  2016cites this paper
• Application Driven Architecture Synthesis

  2016cites this paper
• Bounds and constructions of codes with multiple localities

  2016cites this paper
• The Kurdish Question In Iraq

  2016cites this paper
• On parameters of subfield subcodes of extended norm-trace codes

  2016cites this paper
• A Matrix Decomposition Method for Optimal Normal Basis Multiplication

  2016cites this paper
• Extension Theorems for Various Weight Functions over Frobenius Bimodules

  2016cites this paper
• Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems

  2016cites this paper
• Compression for trace zero points on twisted Edwards curves

  2015cites this paper
• Almost perfect and planar functions

  2015cites this paper
• Forward Error Correction in Real-time Video Streaming Applications

  2015cites this paper
• Matrix representations of vectorial Boolean functions and eigenanalysis

  2015cites this paper
• Sequences with small correlation

  2015cites this paper
• A Survey on Protograph LDPC Codes and Their Applications

  2015cites this paper
• On Some Classes of Z2Z4-Linear Codes and their Covering Radius

  2015cites this paper
• Algorithmic problems for differential polynomial algebras

  2015cites this paper
• Hardware Implementations for Symmetric Key Cryptosystems

  2015cites this paper
• Twisted Hessian Curves

  2015cites this paper
• Long Period Sequences Generated by the Logistic Map over Finite Fields with Control Parameter Four

  2015cites this paper
• On Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Linear Codes and their Covering Radius

  2015cites this paper
• Low autocorrelation binary sequences

  2015cites this paper