Results 11 to 20 of about 1,658,137 (243)
Non-existence of certain perfect binary arrays [PDF]
Electronics Letters, 1993 A perfect binary array (PBA) is an r-dimensional matrix with elements ± 1 such that all out-of-phase periodic autocorrelation coefficients are zero. The two smallest sizes for which the existence of a PBA is undecided, 2 × 2 × 3 × 3 × 9 and 4 × 3 × 3 × 9, are ruled out using computer search and a combinatorial argument.
J. Jedwab, J.A. Davis
openaire +2 more sources
Constructing new perfect binary arrays
Electronics Letters, 1988 Only a small number of different sizes are known for which there exist two-dimensional perfect binary arrays. Construction methods are given which generate new two-dimensional perfect binary arrays, four of which are larger than any previously reported.
Mitchell, C.J., Jedwab, J.
openaire +4 more sources
Comment: ‘Nonexistence of certain perfect binary arrays’ and ‘Nonexistence of perfect binary arrays’ [PDF]
Electronics Letters, 1993 Yang\u27s comment [C] is based on a lemma which claims to construct an s0 x s1 x s2 x ... x s, perfect binary array (PBA) from an s0s1 x s2 x ...
Jedwab, Jonathan, Davis, James A
openaire +2 more sources
Hierarchical Physical-Cyber Encryption via Metasurface-Encoded Holographic Keys. [PDF]
Adv Sci (Weinh)ABSTRACT Physical‐layer encryption based on metasurfaces has emerged as a promising alternative to conventional algorithmic cryptography by embedding security into physical processes. However, most existing metasurface‐based encryption schemes operate within single‐stage or static frameworks, where correct physical illumination directly reveals the ...
Liu Z +8 more
europepmc +2 more sources
Bistable Networks Enable Complex Shape Changes. [PDF]
Adv Sci (Weinh)Transition‐controlled metamaterials are networks of bistable mechanical memory that store local binary states and express them as global shape change. By decoupling low‐force programming from high‐force holding, a single lattice is reconfigured into distinct 2D profiles and 3D surfaces without continuous actuation, enabling reusable morphing materials ...
Thomas S, Lipton J.
europepmc +2 more sources
Perfect binary space partitions [PDF]
, 1997 A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes until all objects are separated. A binary space partition is called perfect if none of the objects is cut by the hyperplanes used by the binary space ...
Groot, MM de +2 more
core +3 more sources
Perfect and Imperfect Duty: Unpacking Kant's Complex Distinction [PDF]
, 2023 I attempt first to disentangle three aspects of Kant’s distinction between perfect and imperfect duty. There is the central distinction between principles of duty contrary to that which is contradictory in conception/consistent in conception but ...
Hope, Simon James
core +1 more source
Perfect binary codes: classification and properties [PDF]
, 2009 An r-perfect binary code is a subset of ℤ2n such that for any word, there is a unique codeword at Hamming distance at most r. Such a code is r-error-correcting.
Pottonen, Olli
core +1 more source
Perfect binary codes: bounds and properties [PDF]
, 2000 Some nontrivial properties of perfect binary codes are discussed. We consider some constructions of perfect binary codes with the purpose to outline bounds on the number of nonequivalent perfect binary codes and we present the best known lower and upper ...
F.I. Solov'eva, Solov'eva, F.I.
core +1 more source
Qualified difference sets from unions of cyclotomic classes [PDF]
, 2009 Qualified difference sets (QDS) composed of unions of cyclotomic classes are discussed. An exhaustive computer search for such QDS and modified QDS that also possess the zero residue has been conducted for all powers n=4,6,8 and 10. Two new families were
Byard, Kevin, Broughan, Kevin A.
core +1 more source