The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2 (Q5077468): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1690587
Created claim: Wikidata QID (P12): Q128205877, #quickstatements; #temporary_batch_1722437626092
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shan-Qi Pang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03610926.2019.1591452 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3001656036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of a few binary orthogonal arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal arrays. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On difference schemes and orthogonal arrays of strength \(t\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of asymmetrical orthogonal arrays having factors with a large non-prime power number of levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly orthogonal arrays mappable into fully orthogonal arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of saturated and nearly saturated asymmetrical orthogonal arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and count of 1-resilient rotation symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schematic saturated orthogonal arrays obtained by using the contractive replacement method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to combinatorial key predistribution schemes for sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between uniformity and orthogonality for symmetrical factorial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of orthogonal Latin hypercube designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal arrays obtained by repeating-column difference matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal arrays obtained by generalized Hadamard product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011713 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128205877 / rank
 
Normal rank

Latest revision as of 17:03, 31 July 2024

scientific article; zbMATH DE number 7528930
Language Label Description Also known as
English
The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2
scientific article; zbMATH DE number 7528930

    Statements

    The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2 (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2022
    0 references
    difference scheme
    0 references
    expansive replacement method
    0 references
    Hamming distance
    0 references
    saturated asymmetrical orthogonal arrays with strength 2
    0 references

    Identifiers