AG codes, t-designs and partition sets

DOI10.1016/J.ENDM.2018.02.013MaRDI QIDQ1742689zbMATH OpenOpenAlexWikidataFDO

Authors Cristina Martínez, Alberto Besana

Publication date 12 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.02.013

zbMATH Keywords

\(t\)-designGrassmanniansets

Mathematics Subject Classification ID

Other designs, configurations (05B30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Codes and designs in Grassmannian spaces.
• Subspace packings: constructions and bounds
• Infinite families of 2-designs and 3-designs from linear codes
• Linear perfect codes and a characterization of the classical designs
• On \(t\)-designs from codes over \(\mathbb{Z}_4\)

Cites work

• Class of generalized Goppa codes perfect in weighted Hamming metric
• Coding for Errors and Erasures in Random Network Coding
• scientific article; zbMATH DE number 4074964 (Why is no real title available?)
• scientific article; zbMATH DE number 3771502 (Why is no real title available?)
• ON GALOIS EXTENSIONS OF A MAXIMAL CYCLOTOMIC FIELD
• Subclass of Cyclic Goppa Codes
• Uniformization of Deligne-Mumford curves

Cited in

(2)

• Codes and designs in Grassmannian spaces.
• Preface to the special issue on network coding and designs

This page was built for publication: AG codes, \(t\)-designs and partition sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742689)