A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions

Résumé

Dissections of polytopes are a well-studied subject by ge-ometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight [TVS09], [SV09], which is shown to be equivalent to the problem of dissecting a tetrahedron to a brick. An application of dissections to a problem related to the construction of analog codes arises in [CVC13]. Here we consider the rectangle-to-rectangle dissection due to Montu-cla [Fre03]. Montucla's dissection is first reinterpreted in terms of the Two Tile Theorem [SV09]. Based on this, a cube-to-brick dissection is developed in R^n. We present a linear time algorithm (in n) that computes the dissection, i.e. determines a point in the cube given a point in a specific realization of the brick. An application of this algorithm to a previously reported analog coding scheme [CVC13] is also discussed.
Fichier principal
Vignette du fichier
wcc15-th3-4.pdf (5.34 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01276485 , version 1 (19-02-2016)

Identifiants

  • HAL Id : hal-01276485 , version 1

Citer

Antonio Campello, Vinay Vaishampayan. A Generalization of Montucla's Rectangle-to-Rectangle Dissection to Higher Dimensions. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276485⟩

Collections

WCC2015
23 Consultations
118 Téléchargements

Partager

Gmail Facebook X LinkedIn More