MWS and FWS codes for coordinate-wise weight functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4031575 (Why is no real title available?)
- scientific article; zbMATH DE number 3477028 (Why is no real title available?)
- 50 Years of the Golomb--Welch Conjecture
- A generalization of Lee codes
- A new approach to error-correcting codes
- A note on full weight spectrum codes
- Algebraic coding theory
- Coding for the Lee and Manhattan Metrics With Weighing Matrices
- Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
- Concatenated codes for the Lee metric (Corresp.)
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Four fundamental parameters of a code and their combinatorial significance
- How Many Weights Can a Cyclic Code Have?
- How Many Weights Can a Quasi-Cyclic Code Have?
- How many weights can a linear code have?
- Interactive Communication of Balanced Distributions and of Correlated Files
- Interleaving schemes for multidimensional cluster errors
- Introduction to Coding Theory
- Lee metric codes over integer residue rings (Corresp.)
- Lee-metric BCH codes and their application to constrained and partial-response channels
- Linear intersecting codes
- Maximum weight spectrum codes
- Nonexistence theorems on perfect Lee codes over large alphabets
- On binary linear codes whose automorphism group is trivial
- On channels and codes for the Lee metric
- On perfect Lee codes
- On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Product Constructions for Perfect Lee Codes
This page was built for publication: MWS and FWS codes for coordinate-wise weight functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025945)
