View : 961 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이윤진*
dc.date.accessioned2020-12-21T16:30:03Z-
dc.date.available2020-12-21T16:30:03Z-
dc.date.issued2020*
dc.identifier.issn0925-1022*
dc.identifier.issn1573-7586*
dc.identifier.otherOAK-28336*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/255745-
dc.description.abstractWe classify all the cyclic self-dual codes of length p(k) over the finite chain ring R := Z(p)[u]/< u(3)>, which is not a Galois ring, where p is a prime number and k is a positive integer. First, we find all the dual codes of cyclic codes over R of length p(k) for every prime p. We then prove that if a cyclic code over R of length p(k) is self-dual, then p should be equal to 2. Furthermore, we completely determine the generators of all the cyclic self-dual codes over Z(p)[u]/< u(3)> of length 2(k). Finally, we obtain a mass formula for counting cyclic self-dual codes over Z(p)[u]/< u(3)> of length 2(k).*
dc.languageEnglish*
dc.publisherSPRINGER*
dc.subjectSelf-dual code*
dc.subjectCyclic code*
dc.subjectChain ring*
dc.subjectMass formula*
dc.subjectGenerator*
dc.subjectideal*
dc.titleClassification of self-dual cyclic codes over the chain ring Z(p)[u]/< u(3)>*
dc.typeArticle*
dc.relation.issue10*
dc.relation.volume88*
dc.relation.indexSCIE*
dc.relation.indexSCOPUS*
dc.relation.startpage2247*
dc.relation.lastpage2273*
dc.relation.journaltitleDESIGNS CODES AND CRYPTOGRAPHY*
dc.identifier.doi10.1007/s10623-020-00776-1*
dc.identifier.wosidWOS:000543673800001*
dc.identifier.scopusid2-s2.0-85087318364*
dc.author.googleKim, Boran*
dc.author.googleLee, Yoonjin*
dc.contributor.scopusid이윤진(23100337700)*
dc.date.modifydate20240123113558*
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE