Infinite families of MDR cyclic codes over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e27154" altimg="si467.svg"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math> via constacyclic codes over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e27164" altimg="si20.svg"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><

Han, Nayoung; Kim, Bohyun; Kim, Boran; Lee, Yoonjin

doi:10.1016/j.disc.2019.111771

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2022

Publication Types

Select...

Other1

Article1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For many years, linear codes have active developments over various rings [9,10,11,12,13,14,17,21,23]. Recently, finding symbol-pair weight and RT weight is a great challenge in coding theory [5,16,22].…”

Section: Introductionmentioning

confidence: 99%

Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes

Kim¹

2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes

Kim¹

2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Jacobi forms over number fields from linear codes

Kim¹,

Kim²,

Kwon³

et al. 2022

MATH

View full text Add to dashboard Cite

<abstract><p>We suggest a Jacobi form over a number field $ \Bbb Q(\sqrt 5, i) $; for obtaining this, we use a linear code $ C $ over $ R: = \Bbb F_4+u\Bbb F_4 $, where $ u^2 = 0 $. We introduce MacWilliams identities for both complete weight enumerator and symmetrized weight enumerator in higher genus $ g\ge 1 $ of a linear code over $ R $. Finally, we give invariants via a self-dual code of even length over $ R $.</p></abstract>

show abstract

Infinite families of MDR cyclic codes over Z4 via constacyclic codes over Z<

Cited by 2 publications

References 16 publications

Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes

Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes

Jacobi forms over number fields from linear codes

Contact Info

Product

Resources

About