On maximum Lee distance codes (Q2249930): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58919936, #quickstatements; #temporary_batch_1704836857466
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/625912 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988825410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee-metric BCH codes and their application to constrained and partial-response channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interleaving schemes for multidimensional cluster errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correction of Multidimensional Bursts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes in Permutations and Error Correction for Rank Modulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance separable codes and arcs in projective spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of vectors of a finite vector space in which every subset of basis size is a basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singleton bounds for codes over finite rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes over \(\mathbb{Z}_{2^k}\), Gray map and self-dual codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance codes over rings of order 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on minimum distance for a k-ary code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On channels and codes for the Lee metric / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 8 July 2024

scientific article
Language Label Description Also known as
English
On maximum Lee distance codes
scientific article

    Statements

    On maximum Lee distance codes (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    Summary: Singleton-type upper bounds on the minimum Lee distance of general (not necessarily linear) Lee codes over \(\mathbb{Z}_q\) are discussed. Two bounds known for linear codes are shown to also hold in the general case, and several new bounds are established. Codes meeting these bounds are investigated and in some cases characterised.
    0 references
    0 references
    0 references
    0 references
    0 references
    Lee distance code
    0 references
    bound
    0 references
    Hamming metric
    0 references
    block code
    0 references
    Lee weight
    0 references
    0 references
    0 references