Equivalence and duality of polycyclic codes associated with trinomials over finite fields

DOI10.1016/J.FFA.2023.102259arXiv2204.12433OpenAlexW4385504827MaRDI QIDQ6136706FDOQ6136706

Authors: Minjia Shi, Haodong Lu, Shuang Zhou, Jiarui Xu, Yuhang Zhu 

Publication date: 31 August 2023

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic codes, and study the self-orthogonal and dual-containing polycyclic codes over F2.

Full work available at URL: https://arxiv.org/abs/2204.12433

Recommendations

• Polycyclic codes associated with trinomials: good codes and open questions
• Construction of isodual codes from polycirculant matrices
• On the duality and the direction of polycyclic codes
• Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
• On the equivalence of codes and codes with an automorphism having two cycles

zbMATH Keywords

equivalencedualitytrinomialspolycyclic codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Cites Work

• Dual generalizations of the concept of cyclicity of codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure of 1-generator quasi-polycyclic codes over finite chain rings
• Codes and rings. Theory and practice
• Polycyclic codes as invariant subspaces
• On polycyclic codes over a finite chain ring
• Construction of isodual codes from polycirculant matrices
• Polycyclic codes associated with trinomials: good codes and open questions

This page was built for publication: Equivalence and duality of polycyclic codes associated with trinomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136706)