Publication: Generalized weights and the Ball-Blokhuis congruence
| dc.contributor.author | ÖZEN, İBRAHİM | |
| dc.contributor.authors | Ozen, Ibrahim | |
| dc.date.accessioned | 2022-03-12T20:27:10Z | |
| dc.date.accessioned | 2026-01-11T10:27:03Z | |
| dc.date.available | 2022-03-12T20:27:10Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In 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.doi | 10.1007/s10623-015-0046-x | |
| dc.identifier.eissn | 1573-7586 | |
| dc.identifier.issn | 0925-1022 | |
| dc.identifier.uri | https://hdl.handle.net/11424/233635 | |
| dc.identifier.wos | WOS:000373858000003 | |
| dc.language.iso | eng | |
| dc.publisher | SPRINGER | |
| dc.relation.ispartof | DESIGNS CODES AND CRYPTOGRAPHY | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Linear codes | |
| dc.subject | Maximum weight codeword | |
| dc.subject | Higher weights | |
| dc.subject | LINEAR CODES | |
| dc.title | Generalized weights and the Ball-Blokhuis congruence | |
| dc.type | article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 235 | |
| oaire.citation.issue | 2 | |
| oaire.citation.startPage | 231 | |
| oaire.citation.title | DESIGNS CODES AND CRYPTOGRAPHY | |
| oaire.citation.volume | 79 |
