Publication: Lattice paths: Coding and complexity
| dc.contributor.authors | Tamm U. | |
| dc.date.accessioned | 2022-03-15T01:57:17Z | |
| dc.date.accessioned | 2026-01-10T17:05:45Z | |
| dc.date.available | 2022-03-15T01:57:17Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | We shall study several sequences of numbers arising in the array (n; k) = 3 · (n+k/k) - 2 · (n+k/k-1) . Some of them relate to an old problem of Berlekamp, which arose in the construction of certain convolutional burst-error detecting codes. The other sequences are of recent interest in combinatorial theory. © 2009 IEEE. | |
| dc.identifier.doi | 10.1109/ITA.2009.5044969 | |
| dc.identifier.isbn | 9781424439904 | |
| dc.identifier.uri | https://hdl.handle.net/11424/246952 | |
| dc.language.iso | eng | |
| dc.publisher | IEEE Computer Society | |
| dc.relation.ispartof | Information Theory and Applications Workshop, ITA 2009 | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.title | Lattice paths: Coding and complexity | |
| dc.type | conferenceObject | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 358 | |
| oaire.citation.startPage | 355 | |
| oaire.citation.title | Information Theory and Applications Workshop, ITA 2009 |