A representation of large integers from combinatorial sieves

DOI10.1006/JNTH.1995.1119zbMath0844.11058OpenAlexW2089611934MaRDI QIDQ1900884

John L. Blanchard

Publication date: 25 October 1995

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1995.1119

zbMATH Keywords

MDS codesrepresentation of large integerscombinatorial sievesconstruction of orthogonal arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Applications of sieve methods (11N36) Theory of error-correcting codes and error-detecting codes (94B99) Representation problems (11D85)

Related Items (2)

An existence theorem for group divisible 3-designs of large order ⋮ The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One

This page was built for publication: A representation of large integers from combinatorial sieves