Covering Arrays and Intersecting Codes

Journal of Combinatorial Designs - United States
doi 10.1002/jcd.3180010106
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

SIAM Journal on Algebraic Discrete Methods
1987English

Hybrid Strength Two Covering Array Constructions: Using Cover Starters to Create Covering Arrays

English

Covering Arrays From Maximal Sequences Over Finite Fields

English

Linear Programming Bounds for Codes via a Covering Argument

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

On the Structure of Small Strength‐2 Covering Arrays

Journal of Combinatorial Designs
CombinatoricsDiscrete Mathematics
2019English

A Review of Covering Arrays and Their Application to Software Testing

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2011English

New Covering Radius of Reed-Muller Codes for T-Resilient Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Bounds on the Covering Radius of Some Classes of Codes Over R

Open Journal of Discrete Applied Mathematics
2019English

Design of Output Codes for Fast Covering Learning Using Basic Decomposition Techniques

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy