Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Turku
1981
|
| Schriftenreihe: | Turun Yliopisto: Turun Yliopiston julkaisuja / A / 1
181 |
| Beschreibung: | 168 S. graph. Darst. |
| ISBN: | 9516419313 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009201497 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1981 d||| |||| 00||| eng d | ||
| 020 | |a 9516419313 |9 951-641-931-3 | ||
| 035 | |a (OCoLC)35380105 | ||
| 035 | |a (DE-599)BVBBV009201497 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29 | ||
| 050 | 0 | |a AS262.T83 | |
| 100 | 1 | |a Aaltonen, Matti |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |c by Matti Aaltonen |
| 264 | 1 | |a Turku |c 1981 | |
| 300 | |a 168 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Turun Yliopisto: Turun Yliopiston julkaisuja / A / 1 |v 181 | |
| 810 | 2 | |a A / 1 |t Turun Yliopisto: Turun Yliopiston julkaisuja |v 181 |w (DE-604)BV002707553 |9 181 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006113848 | ||
Datensatz im Suchindex
| _version_ | 1804123639721754624 |
|---|---|
| any_adam_object | |
| author | Aaltonen, Matti |
| author_facet | Aaltonen, Matti |
| author_role | aut |
| author_sort | Aaltonen, Matti |
| author_variant | m a ma |
| building | Verbundindex |
| bvnumber | BV009201497 |
| callnumber-first | A - General Works |
| callnumber-label | AS262 |
| callnumber-raw | AS262.T83 |
| callnumber-search | AS262.T83 |
| callnumber-sort | AS 3262 T83 |
| callnumber-subject | AS - Academies |
| ctrlnum | (OCoLC)35380105 (DE-599)BVBBV009201497 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00957nam a2200289 cb4500</leader><controlfield tag="001">BV009201497</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1981 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9516419313</subfield><subfield code="9">951-641-931-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35380105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009201497</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">AS262.T83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Aaltonen, Matti</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance</subfield><subfield code="c">by Matti Aaltonen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Turku</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">168 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Turun Yliopisto: Turun Yliopiston julkaisuja / A / 1</subfield><subfield code="v">181</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A / 1</subfield><subfield code="t">Turun Yliopisto: Turun Yliopiston julkaisuja</subfield><subfield code="v">181</subfield><subfield code="w">(DE-604)BV002707553</subfield><subfield code="9">181</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006113848</subfield></datafield></record></collection> |
| id | DE-604.BV009201497 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:32:58Z |
| institution | BVB |
| isbn | 9516419313 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006113848 |
| oclc_num | 35380105 |
| open_access_boolean | |
| owner | DE-29 |
| owner_facet | DE-29 |
| physical | 168 S. graph. Darst. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| record_format | marc |
| series2 | Turun Yliopisto: Turun Yliopiston julkaisuja / A / 1 |
| spelling | Aaltonen, Matti Verfasser aut Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance by Matti Aaltonen Turku 1981 168 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Turun Yliopisto: Turun Yliopiston julkaisuja / A / 1 181 A / 1 Turun Yliopisto: Turun Yliopiston julkaisuja 181 (DE-604)BV002707553 181 |
| spellingShingle | Aaltonen, Matti Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |
| title | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |
| title_auth | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |
| title_exact_search | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |
| title_full | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance by Matti Aaltonen |
| title_fullStr | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance by Matti Aaltonen |
| title_full_unstemmed | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance by Matti Aaltonen |
| title_short | Bounds on the information rate of a tree code as a function of the code's feedback decoding minimum distance |
| title_sort | bounds on the information rate of a tree code as a function of the code s feedback decoding minimum distance |
| volume_link | (DE-604)BV002707553 |
| work_keys_str_mv | AT aaltonenmatti boundsontheinformationrateofatreecodeasafunctionofthecodesfeedbackdecodingminimumdistance |