Results 21 to 30 of about 520,695 (298)

Repeated-root constacyclic codes of length $ 3\ell^mp^s $

open access: diamondAdvances in Mathematics of Communications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Liu   +3 more
openalex   +3 more sources

New Euclidean and Hermitian Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances [PDF]

open access: yesarXiv.org, 2023
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A family of binary
Hao Chen
semanticscholar   +1 more source

Repeated-root constacyclic codes of length 2ℓ m p n∗ [PDF]

open access: green, 2014
For any different odd primes ℓ and p, structure of constacyclic codes of length 2ℓmpn over the finite field Fq of characteristic p and their duals is established in terms of their generator polynomials. Among other results, the characterization and enumeration of all linear complementary dual and self-dual constacyclic codes of length 2ℓmpn are ...
Bocong Chen, Hai Q. Dinh, Hongwei Liu
openalex   +3 more sources

On the Hamming Distances of Constacyclic Codes of Length 5pS

open access: yesIEEE Access, 2020
Let $p$ be a prime, $s$ , $m$ be positive integers, and $\lambda $ be a nonzero element of the finite field $\mathbb {F}_{p^{m}}$ . In this paper, the algebraic structures of constacyclic codes of length $5~p^{s}~(p\neq 5)$ are obtained, which ...
Hai Q. Dinh   +2 more
doaj   +1 more source

Some Repeated-Root Constacyclic Codes Over Galois Rings [PDF]

open access: yesIEEE Transactions on Information Theory, 2017
Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$ is a chain ring.
Hongwei Liu, Youcef Maouche
openaire   +2 more sources

A Special Class of Repeated-Root Constacyclic Codes

open access: diamondAsian Journal of Mathematics and Computer Research
Let \(\mathbb{F}\)q be a finite field with q elements where q be a prime power. Among the classes of constacyclic codes of length 5ℓps over \(\mathbb{F}\)q we define an equivalence relation such that the classes of constacyclic codes which have the same structure are viewed to be equivalent.
Ke Wang
openalex   +3 more sources

On a class of repeated-root monomial-like abelian codes

open access: diamondJournal of Algebra Combinatorics Discrete Structures and Applications, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edgar Martı́nez-Moro   +3 more
openalex   +5 more sources

Some Constacyclic Codes over Finite Chain Rings [PDF]

open access: yes, 2012
For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes.
Batoul, Aicha   +2 more
core   +1 more source

Commuting-projector Hamiltonians for chiral topological phases built from parafermions [PDF]

open access: yes, 2018
We introduce a family of commuting-projector Hamiltonians whose degrees of freedom involve $\mathbb{Z}_{3}$ parafermion zero modes residing in a parent fractional-quantum-Hall fluid.
Alicea, Jason, Son, Jun Ho
core   +2 more sources

Home - About - Disclaimer - Privacy