Name
Abstract | ||
|---|---|---|
This paper presents a qualitative approach of combining Golomb-Rice (GR) code with algebraic bijective mappings which losslessly convert between arbitrary positive integers of different dimension and shape the distribution of generalized Gaussian sources. The mappings, integer nesting and splitting, enables GR encoding, with a little additional computation, to compress more efficiently sources based on wider classes of distributions than Laplacian. Simulations showed, especially for some Gaussian sources, almost optimal average code length can be achievable by performing integer nesting before GR encoding the integers. This scheme will be useful for applications dealing with various types of sources and requiring low computational costs. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/DCC.2018.00080 | 2018 Data Compression Conference |
Keywords | Field | DocType |
Lossless coding,Golomb Rice code,Generalized Gaussian | Integer,Discrete mathematics,Bijection,Algebraic number,Computer science,Golomb coding,Theoretical computer science,Gaussian,Data compression,Computation,Laplace operator | Conference |
ISSN | ISBN | Citations |
1068-0314 | 978-1-5386-4884-1 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryosuke Sugiura | 1 | 3 | 1.89 |
| Yutaka Kamamoto | 2 | 39 | 10.01 |
| Takehiro Moriya | 3 | 89 | 24.08 |