Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Tynan (2019)
CodesA Cultural History of Law in the Age of Reform
VD Tonchev (2007)
Handbook of Combinatorial Designs
C. Ding, Xiaoni Du, Zhengchun Zhou (2015)
The Bose and Minimum Distance of a Class of BCH CodesIEEE Transactions on Information Theory, 61
Mark Fischer, M. Sigrist (2008)
Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theoryEPL (Europhysics Letters), 85
Colin Reid, A. Rosa (2010)
Steiner systems S(2, 4,v) - a surveyElectronic Journal of Combinatorics, 1000
Susanne Ebersbach (2016)
Designs And Their Codes
V. Tonchev (1993)
Quasi-symmetric designs, codes, quadrics, and hyperplane sectionsGeometriae Dedicata, 48
V. Pless (1991)
Codes and designs - existence and uniquenessDiscret. Math., 92
C. Ding (2015)
Parameters of Several Classes of BCH CodesIEEE Transactions on Information Theory, 61
C. Ding (2014)
Codes From Difference Sets
Jon-Lark Kim, V. Pless (2003)
Designs in Additive Codes over GF(4)Designs, Codes and Cryptography, 30
O. Antoine, Berthet
Theory of Error-correcting Codes
C. Ding, Cuiling Fan, Zhengchun Zhou (2016)
The dimension and minimum distance of two classes of primitive BCH codesFinite Fields Their Appl., 45
FJ MacWilliams, NJA Sloane (1977)
The Theory of Error-Correcting Codes
W. Bridges, M. Hall, J. Hayden (1981)
Codes and DesignsJ. Comb. Theory, Ser. A, 31
H. Hanani, J. Schonheim (1964)
On steiner systemsIsrael Journal of Mathematics, 2
W. Huffman, V. Pless (1975)
Fundamentals of Error-Correcting Codes
Venkat Guruswami (2010)
Introduction to Coding Theory
I. Blake, R. Mullin (1975)
Coding and Combinatorics
G. Kennedy, V. Pless (1995)
A coding theoretic approach to extending designsDiscret. Math., 142
D. Jungnickel, V. Tonchev (1991)
Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin boundDesigns, Codes and Cryptography, 1
T Beth, D Jungnickel, H Lenz (1999)
Design Theory
Gholamreza Khosroyshahi, R. Laue (2006)
t -Designs with t ≥ 3
VD Tonchev (1998)
Handbook of Coding Theory
It has been known for a long time that t-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a t-design. While a lot of progress in the direction of constructing codes from t-designs has been made, only a small amount of work on the construction of t-designs from codes has been done. The objective of this paper is to construct infinite families of 2-designs and 3-designs from a type of binary linear codes with five weights. The total number of 2-designs and 3-designs obtained in this paper are exponential in any odd m and the block size of the designs varies in a huge range.
Designs, Codes and Cryptography – Springer Journals
Published: Mar 15, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.