This paper presents new upper bounds on the rate of linear k-hash codes in Fqn, q≥ k, that is, codes with the property that any k distinct codewords are all simultaneously distinct in at least one coordinate.
Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes
Fiore, Stefano Della;Dalai, Marco
2024-01-01
Abstract
This paper presents new upper bounds on the rate of linear k-hash codes in Fqn, q≥ k, that is, codes with the property that any k distinct codewords are all simultaneously distinct in at least one coordinate.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Upper_Bounds_on_the_Rate_of_Linear_Q-Ary_K-Hash_Codes.pdf
accesso aperto
Licenza:
Copyright dell'editore
Dimensione
450.12 kB
Formato
Adobe PDF
|
450.12 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
