Quasi-cyclic codes from a finite affine plane

DOI10.1007/s10623-005-6685-6zbMath1172.94638OpenAlexW3015762444MaRDI QIDQ2491281

Marc Fossorier, Norifumi Kamiya

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-6685-6

zbMATH Keywords

quasi-cyclic codesincidence matricesaffine planescombinatorial designsoval designs

Mathematics Subject Classification ID

Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of finite geometries (05B25) Cyclic codes (94B15)

Related Items (max. 100)

Somep-ranks related to a conic inPG(2,q) ⋮ On generator matrices and parity check matrices of generalized integer codes ⋮ Quasi-cyclic codes from a finite affine plane ⋮ On generator and parity-check polynomial matrices of generalized quasi-cyclic codes

Cites Work

• Unnamed Item
• Some \(p\)-ranks related to orthogonal spaces
• Oval designs in Desarguesian projective planes
• Quasi-cyclic codes from a finite affine plane
• A recursive approach to low complexity codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• On the p-rank of the design matrix of a difference set
• On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• On a class of majority-logic decodable cyclic codes
• On cyclic codes that are invariant under the general linear group
• Polynomial codes
• On majority-logic decoding for duals of primitive polynomial codes
• On generalized ReedMuller codes and their relatives

This page was built for publication: Quasi-cyclic codes from a finite affine plane