Key Predistribution Schemes Based on Orthogonal Arrays with Unique Hamming Distance Distribution
Sign Up to like & getrecommendations! Published in 2020 at "Wireless Personal Communications"
DOI: 10.1007/s11277-020-07133-4
Abstract: With the deep study of the Hamming distances of orthogonal arrays (OAs), the application of OAs has penetrated into many fields, one of which is to construct the key predistribution schemes (KPSs) for distributed sensor… read more here.
Keywords: predistribution schemes; distance distribution; key predistribution; orthogonal arrays ... See more keywords
Key predistribution schemes for wireless sensor networks based on combinations of orthogonal arrays
Sign Up to like & getrecommendations! Published in 2018 at "Ad Hoc Networks"
DOI: 10.1016/j.adhoc.2018.02.006
Abstract: Abstract In general, combinatorial key predistribution schemes (KPSs) have higher local connectivity but lower resilience against a node capture attack than random KPSs for a given key storage. We seek to find an approach to… read more here.
Keywords: predistribution schemes; resilience; local connectivity; key predistribution ... See more keywords
Coarse-grained entanglement classification through orthogonal arrays
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Physics"
DOI: 10.1063/1.5006890
Abstract: Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement… read more here.
Keywords: classification; grained entanglement; classification orthogonal; coarse grained ... See more keywords
The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2
Sign Up to like & getrecommendations! Published in 2019 at "Communications in Statistics - Theory and Methods"
DOI: 10.1080/03610926.2019.1591452
Abstract: Abstract Orthogonal arrays have many connections to other combinatorial designs and are applied in coding theory, the statistical design of experiments, cryptography, various types of software testing and quality control. In this paper, we present… read more here.
Keywords: hamming distances; strength; distances saturated; saturated asymmetrical ... See more keywords
NEARLY-OPTIMUM SELECTION OF STRENGTH t ORTHOGONAL ARRAYS: A STRENGTH AND EFFICIENCY APPRAISAL
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Geomate"
DOI: 10.21660/2018.50.7293
Abstract: The process of enumeration and construction of orthogonal arrays has been extensively studied and several methods to develop and implement them have been proposed. There is, however, a gap in the literature when deciding the… read more here.
Keywords: optimum selection; strength; nearly optimum; selection strength ... See more keywords
Quantum Error-Correcting Codes Based on Orthogonal Arrays
Sign Up to like & getrecommendations! Published in 2023 at "Entropy"
DOI: 10.3390/e25040680
Abstract: In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions. Therefore, this is a generalization of the relation between quantum error-correcting codes… read more here.
Keywords: error correcting; quantum error; orthogonal arrays; correcting codes ... See more keywords
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
Sign Up to like & getrecommendations! Published in 2020 at "Symmetry"
DOI: 10.3390/sym12111895
Abstract: During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays. Although Latin squares… read more here.
Keywords: orthogonal graph; graph squares; graph orthogonal; orthogonal arrays ... See more keywords
Construction of strong group-orthogonal arrays
Sign Up to like & getrecommendations! Published in 2022 at "Statistica Sinica"
DOI: 10.5705/ss.202020.0110
Abstract: Space-filling designs with low-dimensional stratifications are desirable choices for computer experiments. In addition, column orthogonality is an important property of designs for such experiments, because it allows the estimates of the main effects in linear… read more here.
Keywords: group orthogonal; orthogonal arrays; strong group; construction strong ... See more keywords