{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:03:32Z","timestamp":1760238212562,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["787128","653626"],"award-info":[{"award-number":["787128","653626"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011273","name":"FP7 Information and Communication Technologies","doi-asserted-by":"publisher","award":["269985"],"award-info":[{"award-number":["269985"]}],"id":[{"id":"10.13039\/100011273","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this article, we design and evaluate several algorithms for the computation of the optimal Rice coding parameter. We conjecture that the optimal Rice coding parameter can be bounded and verify this conjecture through numerical experiments using real data. We also describe algorithms that partition the input sequence of data into sub-sequences, such that if each sub-sequence is coded with a different Rice parameter, the overall code length is minimised. An algorithm for finding the optimal partitioning solution for Rice codes is proposed, as well as fast heuristics, based on the understanding of the problem trade-offs.<\/jats:p>","DOI":"10.3390\/a13080181","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T10:16:49Z","timestamp":1595931409000},"page":"181","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Optimal Calculation of the Rice Coding Parameter"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7411-0948","authenticated-orcid":false,"given":"Fernando","family":"Solano Donado","sequence":"first","affiliation":[{"name":"Faculty of Electronics and Information Technology, Warsaw University of Technology, 00-665 Warsaw, Poland"},{"name":"Blue Technologies, 02-684 Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"ref_1","unstructured":"Rice, R. (1979). Some Practical Universal Noiseless Coding Techniques."},{"key":"ref_2","unstructured":"Rice, R. (1991). Some Practical Universal Noiseless Coding Techniques\u2014Part III. Module PSI14.K."},{"key":"ref_3","unstructured":"Robinson, T. (1994). SHORTEN: Simple Lossless and Near-Lossless Waveform Compression, Cambridge University Engineering Department. Technical Report."},{"key":"ref_4","unstructured":"Howard, P.G., and Vitter, J.S. (April, January 30). Fast and efficient lossless image compression. Proceedings of the DCC \u201893: Data Compression Conference, Snowbird, UT, USA."},{"key":"ref_5","unstructured":"Memon, N. (1998, January 7). Adaptive coding of DCT coefficients by Golomb-Rice codes. Proceedings of the 1998 International Conference on Image Processing, Chicago, IL, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Malvar, H. (1999, January 29\u201331). Fast progressive wavelet coding. Proceedings of the DCC\u201999 Data Compression Conference, Snowbird, UT, USA.","DOI":"10.1109\/DCC.1999.755683"},{"key":"ref_7","unstructured":"Malvar, H.S. (2006, January 28\u201330). Adaptive run-length\/Golomb-Rice encoding of quantized generalized Gaussian sources with unknown statistics. Proceedings of the Data Compression Conference (DCC\u201906), Snowbird, UT, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1109\/83.855427","article-title":"The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS","volume":"9","author":"Weinberger","year":"2000","journal-title":"IEEE Trans. Image Process."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1109\/TCSVT.2011.2129350","article-title":"A Lossless Color Image Compression Architecture Using a Parallel Golomb-Rice Hardware CODEC","volume":"21","author":"Kim","year":"2011","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_10","unstructured":"Wen, J., and Villasenor, J.D. (1997, January 26\u201329). A class of reversible variable length codes for robust image and video coding. Proceedings of the International Conference on Image Processing, Santa Barbara, CA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Marpe, D., Schwarz, H., and Wiegand, T. (2011, January 11\u201314). Reduced-complexity entropy coding of transform coefficient levels using truncated golomb-rice codes in video compression. Proceedings of the 18th IEEE International Conference on Image Processing, Brussels, Belgium.","DOI":"10.1109\/ICIP.2011.6116664"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1049\/el:20063812","article-title":"ECG compression based on wavelet transform and Golomb coding","volume":"42","author":"Chen","year":"2006","journal-title":"Electron. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/18.817513","article-title":"Optimal prefix codes for sources with two-sided geometric distributions","volume":"46","author":"Merhav","year":"2000","journal-title":"IEEE Trans. Inform. Theor."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1002\/j.1538-7305.1966.tb01052.x","article-title":"Predictive Quantizing Systems (Differential Pulse Code Modulation) for the Transmission of Television Signals","volume":"45","year":"1966","journal-title":"Bell Syst. Tech. J."},{"key":"ref_15","unstructured":"Yeh, P.S., Rice, R.F., and Miller, W. (1991). On the Optimality of Code Options for A Universal Noiseless Coder."},{"key":"ref_16","unstructured":"Montenegro, G., Schumacher, C., and Kushalnagar, N. (2020, July 26). IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs): Overview, Assumptions, Problem Statement, and Goals. Available online: https:\/\/www.hjp.at\/doc\/rfc\/rfc4919.html."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Augustin, A., Yi, J., Clausen, T., and Townsley, W.M. (2016). A Study of LoRa: Long Range Low Power Networks for the Internet of Things. Sensors, 16.","DOI":"10.3390\/s16091466"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Casals, L., Mir, B., Vidal, R., and Gomez, C. (2017). Modeling the Energy Performance of LoRaWAN. Sensors, 17.","DOI":"10.3390\/s17102364"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bouguera, T., Diouris, J.F., Chaillout, J.J., Jaouadi, R., and Andrieux, G. (2018). Energy Consumption Model for Sensor Nodes Based on LoRa and LoRaWAN. Sensors, 18.","DOI":"10.3390\/s18072104"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2225","DOI":"10.1109\/JIOT.2018.2883728","article-title":"Low-Power Wide Area Network Technologies for Internet-of-Things: A Comparative Review","volume":"6","author":"Ikpehai","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1049\/iet-wss.2018.5033","article-title":"Comprehensive survey of the IoT open-source OSs","volume":"8","author":"Qutqut","year":"2018","journal-title":"IET Wirel. Sens. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"8459","DOI":"10.1109\/ACCESS.2018.2808324","article-title":"A Survey on Resource Management in IoT Operating Systems","volume":"6","author":"Musaddiq","year":"2018","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1109\/COMST.2018.2817685","article-title":"Internet of Things (IoT) Operating Systems Support, Networking Technologies, Applications, and Challenges: A Comparative Review","volume":"20","author":"Javed","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_24","unstructured":"Micromole (2019, October 17). Micromole\u2014Sewage Monitoring System for Tracking Synthetic Drug Laboratories. Available online: http:\/\/www.micromole.eu."},{"key":"ref_25","unstructured":"(2020, July 26). SYSTEM. H2020 SYSTEM\u2014Synergy of Integrated Sensors and Technologies for Urban Secured Environment. Available online: https:\/\/cordis.europa.eu\/project\/rcn\/220304\/factsheet\/en."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Liu, J., Chen, F., Yan, J., and Wang, D. (2019). CBN-VAE: A Data Compression Model with Efficient Convolutional Structure for Wireless Sensor Networks. Sensors, 19.","DOI":"10.3390\/s19163445"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"68","DOI":"10.3390\/s140100068","article-title":"RAZOR: A Compression and Classification Solution for the Internet of Things","volume":"14","author":"Danieletto","year":"2014","journal-title":"Sensors"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Liu, J., Chen, F., and Wang, D. (2018). Data Compression Based on Stacked RBM-AE Model for Wireless Sensor Networks. Sensors, 18.","DOI":"10.3390\/s18124273"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"19443","DOI":"10.3390\/s150819443","article-title":"An Efficient Data Compression Model Based on Spatial Clustering and Principal Component Analysis in Wireless Sensor Networks","volume":"15","author":"Yin","year":"2015","journal-title":"Sensors"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"9084","DOI":"10.3390\/s101009084","article-title":"A Sensor Network Data Compression Algorithm Based on Suboptimal Clustering and Virtual Landmark Routing Within Clusters","volume":"10","author":"Jiang","year":"2010","journal-title":"Sensors"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2919","DOI":"10.3390\/s100402919","article-title":"Adaptive-Compression Based Congestion Control Technique for Wireless Sensor Networks","volume":"10","author":"Lee","year":"2010","journal-title":"Sensors"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"3195","DOI":"10.3390\/s100403195","article-title":"Evaluation of Tunable Data Compression in Energy-Aware Wireless Sensor Networks","volume":"10","author":"Ying","year":"2010","journal-title":"Sensors"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Salomon, D., and Motta, G. (2010). Handbook of Data Compression, Springer. [5th ed.].","DOI":"10.1007\/978-1-84882-903-9"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","article-title":"Run-Lenght Encodings","volume":"12","author":"Golomb","year":"1966","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_35","first-page":"159","article-title":"Selecting the Golomb parameter in Rice codings","volume":"42","author":"Kiely","year":"2004","journal-title":"Interplanet. Netw. Prog. Rep."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3264903","article-title":"Sprintz: Time Series Compression for the Internet of Things","volume":"2","author":"Blalock","year":"2018","journal-title":"ACM Interact. Mob. Wearable Ubiquitous Technol."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/8\/181\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:52:03Z","timestamp":1760176323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/8\/181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,27]]},"references-count":36,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,8]]}},"alternative-id":["a13080181"],"URL":"https:\/\/doi.org\/10.3390\/a13080181","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,7,27]]}}}