On maximum Lee distance codes (Q2249930): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 01:21, 20 March 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
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
Lee distance code
0 references
bound
0 references
Hamming metric
0 references
block code
0 references
Lee weight
0 references
