Coding Theorems for Source Coding with Cost

Source coding with a cost function for code symbols is studied and the moment function of the cost is investigated. Our coding theorems show that the optimal exponential moment of the cost is characterized by using the Rényi entropy. Further, coding theorems for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\varepsilon$</tex>-coding are also given.

Authors

Shigeaki Kuzuoka (ORCID: https://orcid.org/0000-0001-5280-1019)

Institutions

Wakayama University (JP)

Publication Details

Published: 2024-11-10
DOI: https://doi.org/10.23919/isita60732.2024.10858257
Citations: 1
Primary Topic: DNA and Biological Computing
Type: article
Field-Weighted Citation Impact: 0.23

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Coding Theorems for Source Coding with Cost

Shigeaki Kuzuoka

Nov 10, 2024

1 citations

DNA and Biological Computing

0.23

article

Coding Theorems for Source Coding with Cost

Shigeaki Kuzuoka

November 10, 2024article en

1 citations

Abstract

Wakayama University (JP)

Decent work and economic growth

Openalex Percentile: Top 40%

DNA and Biological Computing

0.23

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Coding Theorems for Source Coding with Cost — Shigeaki Kuzuoka · (2024) | TGRS Research Map | TGRS