7055 search results - page 7 / 1411 » Some New 4-Designs |
COMBINATORICS
2004
14 years 11 months ago
2004
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
FSE
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
DCC
2003
IEEE
15 years 11 months ago
2003
IEEE
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...