• DocumentCode
    2992501
  • Title

    Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients

  • Author

    Louidor, Erez ; Marcus, Brian

  • Author_Institution
    Dept. of Math., Univ. of British Columbia, Vancouver, BC, Canada
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1045
  • Lastpage
    1049
  • Abstract
    A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf (SIAM J. Discrete Math., 1998). Previous best lower bounds on capacities of certain constraints are improved using the method. It is also shown how this method, as well as their method for computing upper bounds on the capacity, can be applied to constraints which are not of finite-type. Additionally, capacities of 2 families of multi-dimensional constraints are given exactly.
  • Keywords
    Rayleigh channels; channel capacity; channel coding; directed graphs; Rayleigh quotients; directed graph; lower bound computing; multidimensional constraint capacity; symmetric 2-dimensional constraints; Binary sequences; Mathematics; Memory management; Multidimensional systems; Optical recording; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5206056
  • Filename
    5206056