A General Class of Maximal Codes ror Computer Applications

DOI10.1109/T-C.1972.223503MaRDI QIDQ5671916zbMATH OpenOpenAlexFDO

Authors Se June Hong, Arvind M. Patel

Publication date 1972

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1972.223503

Mathematics Subject Classification ID

General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(21)

• The complete characterization of the minimum size supertail in a subspace partition
• Equidistant codes in the Grassmannian
• The maximum size of a partial spread in a finite projective space
• Improved upper bounds for partial spreads
• A note on error-correcting codes for authentication and subliminal channels
• Finite rings with applications.
• Partitions of the 8-dimensional vector space over GF(2)
• Extremal sizes of subspace partitions
• Gaussian partitions
• b_i-byte correcting non-binary perfect codes
• Restricted b_i-byte correcting non-binary optimal codes
• The structure of the minimum size supertail of a subspace partition
• The maximum size of a partial spread. II: Upper bounds
• The minimum size of a finite subspace partition
• The chromatic index of finite projective spaces
• Reconfiguration of subspace partitions
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• The second minimum size of a finite subspace partition
• Partitions of finite vector spaces over \(\mathrm{GF}(2)\) into subspaces of dimensions 2 and \(s\)
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Galois geometries and coding theory

This page was built for publication: A General Class of Maximal Codes ror Computer Applications

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