<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" dtd-version="1.4" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="issn">2411-3336</journal-id>
      <journal-id journal-id-type="eissn">2541-9404</journal-id>
      <journal-title-group>
        <journal-title xml:lang="ru">Записки Горного института</journal-title>
        <journal-title xml:lang="en">Journal of Mining Institute</journal-title>
      </journal-title-group>
      <publisher>
        <publisher-name xml:lang="ru">Санкт-Петербургский горный университет императрицы Екатерины ΙΙ</publisher-name>
        <publisher-name xml:lang="en">Empress Catherine II Saint Petersburg Mining University</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id custom-type="pmi" pub-id-type="custom">pmi-11403</article-id>
      <article-id pub-id-type="uri">https://pmi.spmi.ru/pmi/article/view/11403</article-id>
      <article-categories>
        <subj-group subj-group-type="section-heading" xml:lang="ru">
          <subject>Без раздела</subject>
        </subj-group>
        <subj-group subj-group-type="section-heading" xml:lang="en">
          <subject>Without section</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title xml:lang="en">A method for efficient coding of information texts based on optimal alphabet expansion</article-title>
        <trans-title-group xml:lang="ru">
          <trans-title>Метод эффективного кодирования информационных текстов, основанный на оптимальном расширении алфавита</trans-title>
        </trans-title-group>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="eastern">
            <surname>Livshits</surname>
            <given-names>A. N.</given-names>
          </name>
          <name-alternatives>
            <name name-style="eastern" xml:lang="ru">
              <surname>Лившиц</surname>
              <given-names>А. Н.</given-names>
            </name>
            <name name-style="western" xml:lang="en">
              <surname>Livshits</surname>
              <given-names>A. N.</given-names>
            </name>
          </name-alternatives>
          <email>pmi@spmi.ru</email>
          <xref ref-type="aff" rid="aff1"/>
        </contrib>
        <aff-alternatives id="aff1">
          <aff>
            <institution xml:lang="ru"/>
          </aff>
          <aff>
            <institution xml:lang="en"/>
          </aff>
        </aff-alternatives>
      </contrib-group>
      <pub-date pub-type="epub" iso-8601-date="1975-01-01">
        <day>01</day>
        <month>01</month>
        <year>1975</year>
      </pub-date>
      <pub-date date-type="collection">
        <year>1975</year>
      </pub-date>
      <volume>68</volume>
      <issue>1</issue>
      <fpage>105</fpage>
      <lpage>109</lpage>
      <history>
        <date date-type="received" iso-8601-date="1974-07-13">
          <day>13</day>
          <month>07</month>
          <year>1974</year>
        </date>
        <date date-type="accepted" iso-8601-date="1974-09-26">
          <day>26</day>
          <month>09</month>
          <year>1974</year>
        </date>
        <date date-type="rev-recd" iso-8601-date="1975-01-01">
          <day>01</day>
          <month>01</month>
          <year>1975</year>
        </date>
      </history>
      <permissions>
        <copyright-statement xml:lang="ru">© 1975 А. Н. Лившиц</copyright-statement>
        <copyright-statement xml:lang="en">© 1975 A. N. Livshits</copyright-statement>
        <copyright-year>1975</copyright-year>
        <copyright-holder xml:lang="ru">А. Н. Лившиц</copyright-holder>
        <copyright-holder xml:lang="en">A. N. Livshits</copyright-holder>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0" xml:lang="ru">
          <license-p>Эта статья доступна по лицензии Creative Commons Attribution 4.0 International (CC BY 4.0)</license-p>
        </license>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0" xml:lang="en">
          <license-p>This article is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0)</license-p>
        </license>
      </permissions>
      <self-uri xlink:type="simple" xlink:href="https://pmi.spmi.ru/pmi/article/view/11403">https://pmi.spmi.ru/pmi/article/view/11403</self-uri>
      <abstract xml:lang="ru">
        <p>Задача оптимального кодирования информационных текстов в значительной степени определяет эффективность информационно-поисковая система (ИПС) и автоматизированная система управления (АСУ). Решение этой задачи приводит к минимизации объема необходимой памяти ЭВМ и повышению быстродействия информационного поиска.</p>
      </abstract>
      <abstract xml:lang="en">
        <p>The problem of optimal coding of information texts largely determines the efficiency of information retrieval systems (IRS) and automatic control systems (ACS). The solution of this problem leads to minimizing the required computer memory capacity and increasing the speed of information retrieval.</p>
      </abstract>
    </article-meta>
  </front>
  <body/>
  <back>
    <ref-list>
      <ref id="ref1">
        <label>1</label>
        <mixed-citation xml:lang="ru">Д.А. Хаффмен. Метод построения кодов с минимальной избыточностью. - Кибернетический сборник № 3. М., ИЛ, 1961.</mixed-citation>
        <mixed-citation xml:lang="en">D. A. Huffman. Method of constructing codes with minimal redundancy. Kiberneticheskii sbornik No. 3 Cybernetic Collection No. 3. M., IL, 1961 (in Russian)</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>
