Publication: Lattice Paths: Coding and Complexity
| dc.contributor.authors | Tamm, Ulrich | |
| dc.date.accessioned | 2022-03-12T16:00:38Z | |
| dc.date.accessioned | 2026-01-10T20:24:38Z | |
| dc.date.available | 2022-03-12T16:00:38Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | We shall study several sequences of numbers arising in the array beta(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. | |
| dc.identifier.doi | doiWOS:000271861000054 | |
| dc.identifier.isbn | 978-1-4244-3990-4 | |
| dc.identifier.uri | https://hdl.handle.net/11424/224716 | |
| dc.identifier.wos | WOS:000271861000054 | |
| dc.language.iso | eng | |
| dc.publisher | IEEE | |
| dc.relation.ispartof | 2009 INFORMATION THEORY AND APPLICATIONS WORKSHOP | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.title | Lattice Paths: Coding and Complexity | |
| dc.type | conferenceObject | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 355 | |
| oaire.citation.startPage | 352 | |
| oaire.citation.title | 2009 INFORMATION THEORY AND APPLICATIONS WORKSHOP |