Binary linear codes with few weights from Boolean functions

Wang, Xiaoqiang; Zheng, Dabin; Zhang, Yan

doi:10.1007/s10623-021-00898-0

Search citation statements

Order By: Relevance

Paper Sections

Select...

Few-weight Codes1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For some literature on three-weight codes, see e.g. [40,52,103,121,172,182,184]. Fewweight codes, i.e., -weight codes with ≥ 4 but still being relatively small, are e.g.…”

Section: Few-weight Codesmentioning

confidence: 99%

Divisible Codes

Kurz¹

2021

Preprint

View full text Add to dashboard Cite

A linear code over F with the Hamming metric is called Δ-divisible if the weights of all codewords are divisible by Δ. They have been introduced by Harold Ward a few decades ago [173]. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge.

show abstract

“…For some literature on three-weight codes, see e.g. [40,52,103,121,172,182,184]. Fewweight codes, i.e., -weight codes with ≥ 4 but still being relatively small, are e.g.…”

Section: Few-weight Codesmentioning

confidence: 99%