Pseudo quasi-3 designs and their applications to coding theory

DOI10.1002/JCD.20208MaRDI QIDQ3578150zbMATH OpenOpenAlexFDO

Authors Carl Bracken

Publication date 13 July 2010

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.1740

zbMATH Keywords

error correcting codeGrey Rankin boundquasi-3 designquasi-symmetric design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Linear codes (general theory) (94B05)

Abstract: We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self complementary codes. In this article we give a construction of an infinite family of pseudo quasi-3 designs whose residual designs allow us to construct a family of codes with a new parameter set that meet the Grey Rankin bound.

Recommendations

• Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designs
• New classes of self-complementary codes and quasi-symmetric designs
• Self-complementary balanced codes and quasi-symmetric designs
• Self-dual codes and the nonexistence of a quasi-symmetric 2-\((37,9,8)\) design with intersection numbers 1 and 3
• Quasi-symmetric designs and self-dual codes

Cites work

• Duals of quasi-3 designs are not necessarily quasi-3
• Embedding of the Witt-Mathieu system S(3,6,22) in a symmetric 2-(78,22,6) design
• Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• Near-regularity conditions for designs
• New classes of self-complementary codes and quasi-symmetric designs
• New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
• On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• Quasi-symmetric designs, codes, quadrics, and hyperplane sections
• Transitive groups of collineations on certain designs

Cited in

(4)

• New classes of self-complementary codes and quasi-symmetric designs
• Inner balance of symmetric designs
• Admissible parameters of symmetric designs satisfying \(v=4(k-\lambda)+2\) and symmetric designs with inner balance
• Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)

This page was built for publication: Pseudo quasi-3 designs and their applications to coding theory

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