A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble

05/04/2023
by   Venkatesan Guruswami, et al.
0

We present an explicit construction of a sequence of rate 1/2 Wozencraft ensemble codes (over any fixed finite field 𝔽_q) that achieve minimum distance Ω(√(k)) where k is the message length. The coefficients of the Wozencraft ensemble codes are constructed using Sidon Sets and the cyclic structure of 𝔽_q^k where k+1 is prime with q a primitive root modulo k+1. Assuming Artin's conjecture, there are infinitely many such k for any prime power q.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2019

Two-weight codes over the integers modulo a prime power

Let p be a prime number. Irreducible cyclic codes of length p^2-1 and di...
research
10/05/2021

Optimal N-ary ECOC Matrices for Ensemble Classification

A new recursive construction of N-ary error-correcting output code (ECOC...
research
07/05/2022

Two families of negacyclic BCH codes

Negacyclic BCH codes are a subclass of neagcyclic codes and are the best...
research
08/20/2017

On the construction of small subsets containing special elements in a finite field

In this note we construct a series of small subsets containing a non-d-t...
research
08/03/2021

On the Structure of the Binary LCD Codes having an Automorphism of Odd Prime Order

The aim of this work is to study the structure and properties of the bin...
research
05/01/2022

QC-LDPC Codes from Difference Matrices and Difference Covering Arrays

We give a framework for generalizing LDPC code constructions that use Tr...
research
02/02/2023

Certain Diagonal Equations and Conflict-Avoiding Codes of Prime Lengths

We study the construction of optimal conflict-avoiding codes (CAC) from ...

Please sign up or login with your details

Forgot password? Click here to reset