On compressing complete designs

DOI10.1016/S0378-3758(98)00089-5MaRDI QIDQ1298922zbMATH OpenOpenAlexFDO

Authors Reza Naserasr, Gholamreza Khosrovshahi

Publication date 19 July 2001

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0378-3758(98)00089-5

Mathematics Subject Classification ID

Statistical block designs (62K10) Combinatorial aspects of block designs (05B05)

Recommendations

• P-complete problems in data compression
• An abstract model for compressions
• Compressibility and uniform complexity
• Optimal complexity of deployable compressive structures
• scientific article; zbMATH DE number 1927344
• On the minimum weights of compression structures
• scientific article; zbMATH DE number 3552381
• Combinatorial designs and related computational constructions
• A coding theoretic approach to extending designs

Cites work

• scientific article; zbMATH DE number 45817 (Why is no real title available?)
• Complete designs with blocks of maximal multiplicity
• Convex sets of finite population plans
• On theory and applications of BIB designs with repeated blocks
• Partitions of the 4-subsets of a 13-set into disjoint projective planes

Cited in

(1)

• An Evans-style result for block designs

This page was built for publication: On compressing complete designs

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