3 years ago

How many weights can a linear code have?

Minjia Shi, Hongwei Zhu, Patrick Solé, Gérard D. Cohen

Abstract

We study the combinatorial function L(kq),  the maximum number of nonzero weights a linear code of dimension k over \({\mathbb {F}}_q\) can have. We determine it completely for \(q=2,\) and for \(k=2,\) and provide upper and lower bounds in the general case when both k and q are \(\ge 3.\) A refinement L(nkq),  as well as nonlinear analogues N(Mq) and N(nMq),  are also introduced and studied.

Open access
You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.