• DocumentCode
    1520055
  • Title

    On graphs in which the Shannon capacity is unachievable by finite product

  • Author

    Guo, Feng ; Watanabe, Yoichiro

  • Author_Institution
    Dept. of Electron., Doshisha Univ., Kyoto, Japan
  • Volume
    36
  • Issue
    3
  • fYear
    1990
  • fDate
    5/1/1990 12:00:00 AM
  • Firstpage
    622
  • Lastpage
    623
  • Abstract
    Given a graph G, there is a maximum number α(G ) of vertices that are mutually nonadjacent. A class of graphs, including the sum of an odd cycle C2n+3(n⩾1) and a universal graph for which the Shannon capacity is not achieved by any finite power is described
  • Keywords
    channel capacity; graph theory; information theory; Shannon capacity; finite product; graphs; information theory; Broadcasting; Capacity planning; Conferences; Electrons; Energy resolution; Feedback; Multiaccess communication; Notice of Violation; Read only memory; Throughput;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.54907
  • Filename
    54907
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1520055