Cyclic and BCH codes whose minimum distance equals their maximum BCH bound (Q326325): Difference between revisions

@@ Property / describes a project that uses @@
+GAP
@@ Property / describes a project that uses: GAP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/amc.2016018
+Normal rank
@@ Property / OpenAlex ID @@
+W2346418928
@@ Property / OpenAlex ID: W2346418928 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4121811
@@ Property / cites work: Q4121811 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242018
@@ Property / cites work: Q4242018 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic generalization of BCH-Goppa-Helgert codes
+Normal rank
@@ Property / cites work @@
+Fundamentals of Error-Correcting Codes
@@ Property / cites work: Fundamentals of Error-Correcting Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum distance of cyclic codes
@@ Property / cites work: On the minimum distance of cyclic codes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:326325