Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound

From MaRDI portal
Publication:1182421

DOI10.1007/BF00123764zbMath0766.05009OpenAlexW2012023361MaRDI QIDQ1182421

Dieter Jungnickel, Vladimir D. Tonchev

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1007/bf00123764




Related Items (23)

Designs with the symmetric difference property on 64 points and their groupsOn quasi-symmetric 2-(28, 12, 11) and 2-(36, 16, 12) designsThe characterization of binary constant weight codes meeting the bound of Fu and ShenQuasi-symmetric designs and codes meeting the Grey-Rankin boundSwitching for 2-designsThe uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes] ⋮ Linearly embeddable designsInfinite families of 3-designs from a type of five-weight codeMaximal arcs and quasi-symmetric designsSteiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codesOn some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \)Quasi-symmetric \(2\)-\((28,12,11)\) designs with an automorphism of order \(5\)On binary self-complementary [120, 9, 56 codes having an automorphism of order 3 and associated SDP designs] ⋮ Switching codes and designsCyclic quasi-symmetric designs and self-orthogonal codes of length 63Pseudo quasi-3 designs and their applications to coding theoryParameters of 2-Designs from Some BCH CodesCharacterization of SDP designs that yield certain spin modelsExtremal unimodular lattices in dimension 36Characterization of certain minimal rank designsOn the error-detecting performance of some classes of block codesQuasi-symmetric designs, codes, quadrics, and hyperplane sectionsOn the \([28,7,12\) binary self-complementary codes and their residuals]



Cites Work


This page was built for publication: Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound