DOI: 10.1145/321879.321883. Efficient Generation of Optimal Prefix Code

Efficient Generation of Optimal Prefix Code

10.1145/321879.321883

Crossref journal-article

Association for Computing Machinery (ACM)

Journal of the ACM (320)

Bibliography

Perl, Y., Garey, M. R., & Even, S. (1975). Efficient Generation of Optimal Prefix Code. Journal of the ACM, 22(2), 202â214.

Authors 3

Y. Perl (first)
M. R. Garey (additional)
S. Even (additional)

References 6 Referenced 38

{'key': 'e_1_2_1_1_2', 'first-page': '10', 'volume': '40', 'author': 'I~ UFFMAN', 'year': '1952', 'journal-title': 'Proc IRE'} / Proc IRE by I~ UFFMAN (1952)
{'key': 'e_1_2_1_2_2', 'first-page': '27', 'author': 'Minimum IRE', 'year': '1961', 'journal-title': 'Trans. inform Theory 1T-7'} / Trans. inform Theory 1T-7 by Minimum IRE (1961)
10.1016/S0019-9958(71)90155-0 / Inform. Contr. by Optimal (1971)
10.1145/512274.512284 / Comm ACM by Heapsort Algorithm (1964)
10.1145/355588.365103
{'key': 'e_1_2_1_6_2', 'first-page': '145', 'author': 'N~ TH', 'year': '1973', 'journal-title': 'Mass'} / Mass by N~ TH (1973)

Dates

Type	When
Created	23 years, 1 month ago (July 27, 2002, 7:26 a.m.)
Deposited	2 months, 2 weeks ago (June 17, 2025, 10:07 p.m.)
Indexed	2 months, 2 weeks ago (June 18, 2025, 12:33 a.m.)
Issued	50 years, 5 months ago (April 1, 1975)
Published	50 years, 5 months ago (April 1, 1975)
Published Online	50 years, 5 months ago (April 1, 1975)
Published Print	50 years, 5 months ago (April 1, 1975)

Funders 0

None

BibTeX

@article{Perl_1975, title={Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters}, volume={22}, ISSN={1557-735X}, url={http://dx.doi.org/10.1145/321879.321883}, DOI={10.1145/321879.321883}, number={2}, journal={Journal of the ACM}, publisher={Association for Computing Machinery (ACM)}, author={Perl, Y. and Garey, M. R. and Even, S.}, year={1975}, month=apr, pages={202–214} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T04:33:51Z",
    "timestamp": 1750221231007,
    "version": "3.41.0"
  },
  "reference-count": 6,
  "publisher": "Association for Computing Machinery (ACM)",
  "issue": "2",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1975,
            4,
            1
          ]
        ],
        "date-time": "1975-04-01T00:00:00Z",
        "timestamp": 165542400000
      },
      "content-version": "vor",
      "delay-in-days": 0,
      "URL": "https://www.acm.org/publications/policies/copyright_policy#Background"
    }
  ],
  "content-domain": {
    "domain": [
      "dl.acm.org"
    ],
    "crossmark-restriction": true
  },
  "published-print": {
    "date-parts": [
      [
        1975,
        4
      ]
    ]
  },
  "DOI": "10.1145/321879.321883",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        27
      ]
    ],
    "date-time": "2002-07-27T11:26:10Z",
    "timestamp": 1027769170000
  },
  "page": "202-214",
  "update-policy": "https://doi.org/10.1145/crossmark-policy",
  "source": "Crossref",
  "is-referenced-by-count": 38,
  "title": "Efficient Generation of Optimal Prefix Code",
  "prefix": "10.1145",
  "volume": "22",
  "author": [
    {
      "given": "Y.",
      "family": "Perl",
      "sequence": "first",
      "affiliation": [
        {
          "name": "Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel"
        }
      ]
    },
    {
      "given": "M. R.",
      "family": "Garey",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "Bell Laboratories, Murray Hill, NJ"
        }
      ]
    },
    {
      "given": "S.",
      "family": "Even",
      "sequence": "additional",
      "affiliation": [
        {
          "name": "Department of Computer Science, Technion, Haifa, Israel and The Weizmann Institute of Science, Rehovot, Israel"
        }
      ]
    }
  ],
  "member": "320",
  "published-online": {
    "date-parts": [
      [
        1975,
        4
      ]
    ]
  },
  "reference": [
    {
      "key": "e_1_2_1_1_2",
      "first-page": "10",
      "volume": "40",
      "author": "I~ UFFMAN",
      "year": "1952",
      "journal-title": "Proc IRE"
    },
    {
      "key": "e_1_2_1_2_2",
      "first-page": "27",
      "author": "Minimum IRE",
      "year": "1961",
      "journal-title": "Trans. inform Theory 1T-7"
    },
    {
      "key": "e_1_2_1_3_2",
      "doi-asserted-by": "crossref",
      "first-page": "289",
      "DOI": "10.1016/S0019-9958(71)90155-0",
      "volume": "19",
      "author": "Optimal",
      "year": "1971",
      "journal-title": "Inform. Contr."
    },
    {
      "key": "e_1_2_1_4_2",
      "doi-asserted-by": "crossref",
      "first-page": "347",
      "DOI": "10.1145/512274.512284",
      "volume": "7",
      "author": "Heapsort Algorithm",
      "year": "1964",
      "journal-title": "Comm ACM"
    },
    {
      "key": "e_1_2_1_5_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/355588.365103"
    },
    {
      "key": "e_1_2_1_6_2",
      "first-page": "145",
      "author": "N~ TH",
      "year": "1973",
      "journal-title": "Mass"
    }
  ],
  "container-title": "Journal of the ACM",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://dl.acm.org/doi/10.1145/321879.321883",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://dl.acm.org/doi/pdf/10.1145/321879.321883",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T02:07:05Z",
    "timestamp": 1750212425000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://dl.acm.org/doi/10.1145/321879.321883"
    }
  },
  "subtitle": [
    "Equiprobable Words Using Unequal Cost Letters"
  ],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1975,
        4
      ]
    ]
  },
  "references-count": 6,
  "journal-issue": {
    "issue": "2",
    "published-print": {
      "date-parts": [
        [
          1975,
          4
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1145/321879.321883"
  ],
  "URL": "http://dx.doi.org/10.1145/321879.321883",
  "relation": {},
  "ISSN": [
    "0004-5411",
    "1557-735X"
  ],
  "subject": [],
  "container-title-short": "J. ACM",
  "published": {
    "date-parts": [
      [
        1975,
        4
      ]
    ]
  },
  "assertion": [
    {
      "value": "1975-04-01",
      "order": 2,
      "name": "published",
      "label": "Published",
      "group": {
        "name": "publication_history",
        "label": "Publication History"
      }
    }
  ]
}