Yayın:
Counting codes over rings

Basit öğe sayfası
dc.contributor.authorDougherty, Steven T.
dc.contributor.authorSalturk, Esengul
dc.date.accessioned2026-06-27T13:28:52Z
dc.date.issued2014
dc.description.abstractWe extend the definition of free codes to codes over local rings and arbitrary Frobenius rings. The number of free codes over finite Frobenius rings is determined by calculating the number for local rings and applying the Chinese Remainder Theorem. A formula for the number of codes of arbitrary type over a finite chain ring is given and this is applied to determine the number of linear codes over a finite principal ideal ring.en
dc.description.urihttps://doi.org/10.1007/s10623-013-9815-6
dc.identifier.doi10.1007/s10623-013-9815-6
dc.identifier.eissn1573-7586
dc.identifier.endpage165
dc.identifier.issn0925-1022
dc.identifier.issue1
dc.identifier.startpage151
dc.identifier.urihttps://hdl.handle.net/20.500.14981/53083
dc.identifier.volume73
dc.identifier.wos000338656100011
dc.language.isoeng
dc.publisherSPRINGER
dc.relation.ispartofDESIGNS CODES AND CRYPTOGRAPHY
dc.subjectLinear codes
dc.subjectFree codes
dc.subjectFinite chain rings
dc.subjectFinite principal ideal rings
dc.subjectHIGHER WEIGHTS
dc.subjectINDEPENDENCE
dc.subjectComputer Science
dc.subjectMathematics
dc.titleCounting codes over rings
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar