Skip to search formSkip to main contentSkip to account menu

Coset leader

In coding theory, a coset leader is a word of minimum weight in any particular coset - that is, a word with the lowest amount of non-zero entries… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Burst error-correcting codeCoding theoryDecoding methodsLinear code

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On Binary LCD Cyclic Codes
2015
2015
A further study of large payloads matrix embedding
2014
2014
Efficient representation of binary nonlinear codes: constructions and minimum distance computation
A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some… 
2012
2012
Unconformable stratigraphy in East Antarctica: Part II. Englacial cosets and recrystallized layers
Complex unconformable englacial stratigraphy, including a segment of distinctive cosets of bed sequences, occurs throughout the… 
2010
2010
A family of sequences with large size and good correlation property arising from $M$-ary Sidelnikov sequences of period $q^d-1$
Let $q$ be any prime power and let $d$ be a positive integer greater than 1. In this paper, we construct a family of $M$-ary… 
1993
1993
A New Structured Quantizer for Sources with Memory
For high quantization rates, Lookabaugh and Gray have demonstrated that the advantages of optimum vector quantization over… 
Highly Cited
1989
Highly Cited
1989
Coset codes for partial response channels; or, coset codes with spectral nulls
Known coset codes are adapted for use on partial response channels or to generate signals with spectral nulls. By using coset… 
1976
1976
Computer aided determination of a Fibonacci group
The Fibonacci group F(2, 7) has been known to be cyclic of order 29 for about five years. This was first established by computer… 
1974
1974
A new theorem about the Mattson-Solomon polynomial, and some applications
Let F = GF(2) , and FG = F[x]/(x^n + 1). FG is the residue class ring of polynomials mod x^n + 1 . An element of FG is… 
1969
1969
Correction of synchronization errors with burst-error-correcting cyclic codes
It is shown that every linear cyclic b -burst-error-correcting code over any finite field can be modified to correct up to (b-2… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)