Use of Grobner bases to decode binary cyclic codes up to the true minimum distance (Q4324145): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1109/18.333885 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171613506 / rank | |||
Normal rank | |||
Latest revision as of 01:12, 20 March 2024
scientific article; zbMATH DE number 727147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Use of Grobner bases to decode binary cyclic codes up to the true minimum distance |
scientific article; zbMATH DE number 727147 |
Statements
Use of Grobner bases to decode binary cyclic codes up to the true minimum distance (English)
0 references
1 March 1995
0 references
ideal theory
0 references
decoding
0 references
cyclic codes
0 references
Gröbner bases
0 references
error-locator polynomial
0 references
