Affine Cartesian codes with complementary duals
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914668029673472 |
|---|---|
| author | López, Hiram H. Manganiello, Felice Matthews, Gretchen L. |
| author_facet | López, Hiram H. Manganiello, Felice Matthews, Gretchen L. |
| contents | A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed-Solomon codes arise as duals of Reed-Solomon codes. Generalized affine Cartesian codes are evaluation codes constructed by evaluating multivariate polynomials of bounded degree at points in $m$-dimensional Cartesian set over a finite field $K$ and scaling the coordinates. The LCD property depends on the scalars used. Because Reed-Solomon codes are a special case, we obtain a characterization of those generalized Reed-Solomon codes which are LCD along with the more general result for generalized affine Cartesian codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1805_07018 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Affine Cartesian codes with complementary duals López, Hiram H. Manganiello, Felice Matthews, Gretchen L. Information Theory 11T71 (Primary) 94B27, 14G50 (Secondary) A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the duals of affine Cartesian codes in the same way that generalized Reed-Solomon codes arise as duals of Reed-Solomon codes. Generalized affine Cartesian codes are evaluation codes constructed by evaluating multivariate polynomials of bounded degree at points in $m$-dimensional Cartesian set over a finite field $K$ and scaling the coordinates. The LCD property depends on the scalars used. Because Reed-Solomon codes are a special case, we obtain a characterization of those generalized Reed-Solomon codes which are LCD along with the more general result for generalized affine Cartesian codes. |
| title | Affine Cartesian codes with complementary duals |
| topic | Information Theory 11T71 (Primary) 94B27, 14G50 (Secondary) |
| url | https://arxiv.org/abs/1805.07018 |