Pith. sign in

REVIEW 1 cited by

A partition of the hypercube into maximally nonparallel Hamming codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1210.0010 v2 pith:SGA3LGNO submitted 2012-09-28 cs.IT cs.DMmath.COmath.IT

Denis Krotov (Sobolev Institute of Mathematics , Novosibirsk , Russia) This is my paper · ORCID
classification cs.ITcs.DMmath.COmath.IT
keywords codescosetshamminghypercubemaximallynonparallelpartitionadmit
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

By using the Gold map, we construct a partition of the hypercube into cosets of Hamming codes such that for every two cosets the corresponding Hamming codes are maximally nonparallel, that is, their intersection cardinality is as small as possible to admit nonintersecting cosets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Structure of Extremal Bad Science Matrices

    math.FA 2025-09 conditional novelty 7.0 of 10

    For unit-row matrices, the maximal average sup-norm over Rademacher vectors is sqrt(2 log(2n)) - log log(2n)/(2 sqrt(2 log(2n))) + o(1/sqrt(log n)) for explicit Hadamard-based matrices and random sign matrices, with e...

Pith tools