Equivalence and duality of polycyclic codes associated with trinomials over finite fields
From MaRDI portal
Publication:6136706
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.
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
Cites Work
- scientific article; zbMATH DE number 7374772 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- Codes and rings. Theory and practice
- Construction of isodual codes from polycirculant matrices
- Dual generalizations of the concept of cyclicity of codes
- On polycyclic codes over a finite chain ring
- On the structure of 1-generator quasi-polycyclic codes over finite chain rings
- Polycyclic codes as invariant subspaces
- 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)