On zero neighbours and trial sets of linear codes

Published 27 Nov 2014 in cs.IT and math.IT | (1411.7493v1)

Abstract: In this work we study the set of leader codewords of a non-binary linear code. This set has some nice properties related to the monotonicity of the weight compatible order on the generalized support of a vector in $\mathbb F_q^n$. This allows us to describe a test set, a trial set and the set zero neighbours in terms of the leader codewords.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.