Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over <inline-formula><math display="inline"><semantics><mrow><msub><mi mathvariant="double-struck">F</mi><mi>q</mi></msub><mo>+</mo><mi>u</mi><msub><mi mathvariant="double-struck">F</mi><mi>q</mi></msub><mo>+</mo><msup><mi>u</mi><mn>2</mn></msup><msub><mi mathvariant="double-struck">F</mi><mi>q</mi></msub></mrow></semantics></math></inline-formula>

Let <i>p</i> be an odd prime, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ϑ</mi></semantics></math></inline-formula> and <i>m</i> are positive integers. Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><s...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Hai Q. Dinh, Jamal Laaouine, Brahim Boudine, Woraphon Yamaka
Formato:	Artigo
Idioma:	Inglês
Publicado em:	MDPI AG 2022-07-01
coleção:	Mathematics
Assuntos:	finite chain ring constacyclic codes repeated-root codes symbol-triple distance
Acesso em linha:	https://www.mdpi.com/2227-7390/10/14/2496
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!