• DocumentCode
    747292
  • Title

    Aperiodic and semi-periodic perfect maps

  • Author

    Mitchell, Chris J.

  • Author_Institution
    Dept. of Comput. Sci., London Univ., Egham, UK
  • Volume
    41
  • Issue
    1
  • fYear
    1995
  • fDate
    1/1/1995 12:00:00 AM
  • Firstpage
    88
  • Lastpage
    95
  • Abstract
    Paterson (see ibid., vol.40, p.743, 1993) has shown that the trivial necessary conditions are sufficient for the existence of a (binary) perfect map. These periodic structures can be transformed very simply into corresponding aperiodic and semi-periodic perfect maps. However, aperiodic and semi-periodic perfect maps can exist for parameter sets for which the corresponding periodic perfect maps cannot. In this paper it is shown, by construction, that (binary) aperiodic and semi-periodic perfect maps exist for all possible parameter sets
  • Keywords
    array signal processing; decoding; aperiodic perfect maps; binary perfect map; decoding; parameter sets; periodic structures; position location; semi-periodic perfect maps; trivial necessary conditions; Bonding; Computer science; Logic arrays; Periodic structures; Writing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.370116
  • Filename
    370116