Publication:
Generalized weights and the Ball-Blokhuis congruence

dc.contributor.authorÖZEN, İBRAHİM
dc.contributor.authorsOzen, Ibrahim
dc.date.accessioned2022-03-12T20:27:10Z
dc.date.accessioned2026-01-11T10:27:03Z
dc.date.available2022-03-12T20:27:10Z
dc.date.issued2016
dc.description.abstractIn a 2013 article, Ball and Blokhuis proved a congruence for a linear [n, k] code with a codeword of weight n. Their proof is based on a character sum on the group of 1 x (k-1) nonzeromatrices. We showthat the same argumentworks for groups of r x (k-1) matrices for every r, 1 <= r <= k. So we extend their theorem by giving a family of k congruences.
dc.identifier.doi10.1007/s10623-015-0046-x
dc.identifier.eissn1573-7586
dc.identifier.issn0925-1022
dc.identifier.urihttps://hdl.handle.net/11424/233635
dc.identifier.wosWOS:000373858000003
dc.language.isoeng
dc.publisherSPRINGER
dc.relation.ispartofDESIGNS CODES AND CRYPTOGRAPHY
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectLinear codes
dc.subjectMaximum weight codeword
dc.subjectHigher weights
dc.subjectLINEAR CODES
dc.titleGeneralized weights and the Ball-Blokhuis congruence
dc.typearticle
dspace.entity.typePublication
oaire.citation.endPage235
oaire.citation.issue2
oaire.citation.startPage231
oaire.citation.titleDESIGNS CODES AND CRYPTOGRAPHY
oaire.citation.volume79

Files