AI Chat AI Image Generator AI Video Text to Speech

Construction of quaternary Hermitian LCD codes

07/02/2022

∙

by Keita Ishizuka, et al.

∙

∙

We introduce a general construction of many Hermitian LCD [n, k] codes from a given Hermitian LCD [n, k] code. Furthermore, we present some results on punctured codes and shortened codes of quaternary Hermitian LCD codes. As an application, we improve some of the previously known lower bounds on the largest minimum weights of quaternary Hermitian LCD codes of length 12 ≤ n ≤ 30.

page 1

page 2

page 3

page 4

research

∙ 08/28/2021

Construction for both self-dual codes and LCD codes

From a given [n, k] code C, we give a method for constructing many [n, k...

0 Keita Ishizuka, et al. ∙

research

∙ 08/19/2021

A construction of maximally recoverable codes

We construct a family of linear maximally recoverable codes with localit...

0 Alexander Barg, et al. ∙

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...

0 Diane Donovan, et al. ∙

research

∙ 01/05/2023

Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the addit...

0 Chenyang Zhang, et al. ∙

research

∙ 06/14/2019

Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations

The study of Armstrong codes is motivated by the problem of understandin...

0 Yeow Meng Chee, et al. ∙

research

∙ 09/24/2018

On Finding the Largest Minimum Distance of Locally Recoverable Codes

The (n, k, r)-Locally recoverable codes (LRC) studied in this work are (...

0 Majid Khabbazian, et al. ∙

research

∙ 11/04/2019

A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction

Echelon-Ferrers is one of important techniques to help researchers to im...

0 Xianmang He, et al. ∙