Nonrandom binary superimposed codes

From MaRDI portal
Revision as of 23:35, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5342842

DOI10.1109/TIT.1964.1053689zbMath0133.12402OpenAlexW1968160142MaRDI QIDQ5342842

R. C. Singleton, William H. Kautz

Publication date: 1964

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1964.1053689




Related Items (only showing first 100 items - show all)

On the upper bound of the size of the \(r\)-cover-free families2-Cancellative Hypergraphs and CodesList decoding for a multiple access hyperchannelAlmost cover-free codesAn upper bound on error probability in communication systems with single-user reception based on order statisticsSOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODESImproved algorithms for group testing with inhibitorsGeneralized framework for group testing: queries, feedbacks and adversariesLower bounds for cover-free familiesOn the extremal combinatorics of the Hamming spacePattern matching with don't cares and few errorsExact learning from an honest teacher that answers membership queriesTracing a single userGeneralised cumulative arrays in secret sharingA simple construction of \(d\)-disjunct matrices with certain constant weightsTwo applications of separating systems to nonadaptive proceduresConstraining the number of positive responses in adaptive, non-adaptive, and two-stage group testingCodes identifying sets of vertices in random networksStructure-aware combinatorial group testing: a new method for pandemic screeningReal-valued group testing for quantitative molecular assaysStrongly separable matrices for nonadaptive combinatorial group testingExploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matricesA Zig-Zag Approach for Competitive Group TestingSynthetic sequence design for signal location searchImproved constructions for non-adaptive threshold group testingFaster deterministic wakeup in multiple access channelsUniform hypergraphs containing no gridsLinear Time Constructions of Some $$d$$-Restriction Problems$$\epsilon $$-Almost Selectors and Their ApplicationsLeader election in ad hoc radio networks: a keen ear helpsSudoku associative memorySeparating codes and a new combinatorial search modelGeneralization of IPP codes and IPP set systemsTraceability codes and their generalizationsOn the complexity of neighbourhood learning in radio networksA generalization of Macula's disjunct matricesNon-adaptive group testing on graphs with connectivityDistributed broadcast in radio networks of unknown topology.Locating and detecting arrays for interaction faultsOn a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling designNew combinatorial structures with applications to efficient group testing with inhibitorsImproved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosisNon-adaptive learning of a hidden hypergraphOn deterministic sketching and streaming for sparse recovery and norm estimationWatching systems in graphs: an extension of identifying codesConstructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.Generalized cover-free families.Uniqueness of some optimal superimposed codesStrict group testing and the set basis problemPooling spaces associated with finite geometryBounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group TestingExistence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noiseGroup testing with random pools: Phase transitions and optimal strategySome new bounds for cover-free familiesA new strongly competitive group testing algorithm with small sequentialityError analysis for superimposed random codingBetter goodness-of-fit statistics for coded FSK decodingObtaining reliability values from nonparametric receiver: the ``optimal parameter choiceGeneral theory of information transfer: UpdatedCoding for a multiple access OR channel: A surveySymmetric disjunctive list-decoding codesAlmost cover-free codes and designsAn unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distributionAlmost separable matricesCodes with the identifiable parent property for multimedia fingerprintingSome new bounds for cover-free families through biclique coversFamilies of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) othersOn 2-parent-identifying set systems of block size 4Bounds on the rate of disjunctive codesTime complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinismA novel use of \(t\)-packings to construct \(d\)-disjunct matricesA class of error-correcting pooling designs over complexesA classification of the structures of some Sperner families and superimposed codesUnion-intersection-bounded families and their applicationsDeterministic M2M multicast in radio networksLow-weight superimposed codes and related combinatorial structures: bounds and applicationsMore on pooling spacesConstruction of a superimposed code using partitionsOn the construction of \((w,r)\) cover-free codesThe minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranksSeparable collusion-secure multimedia codesA universal bound for a covering in regular posets and its application to pool testingApplication of cover-free codes and combinatorial designs to two-stage testing.On the upper bounds of the minimum number of rows of disjunct matricesA recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic frameworkERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICESGroup testing with geometry of classical groups over finite fieldsNonadaptive algorithms for threshold group testingTropical Complexity, Sidon Sets, and Dynamic ProgrammingNon-adaptive group testing in the presence of errorsNon-adaptive Learning of a Hidden HypergraphSecure frameproof codes, key distribution patterns, group testing algorithms and related structuresPooling spaces and non-adaptive pooling designsOn Efficient Gossiping in Radio NetworksA NEW CONSTRUCTION FOR POOLING DESIGNSCoding for a Multiple Access OR Channel: a SurveyCodes Identifying Vertices in GraphsOn some connections between permutations and codingA new randomized algorithm for group testing with unknown number of defective itemsAlmost disjunctive list-decoding codes







This page was built for publication: Nonrandom binary superimposed codes