PreprintarXiv licencearXiv
Copying Versus Randomization in Lempel-Ziv Music Synthesis
Abstract
We utilize Lempel-Ziv universal compression for music note generation. We control the algorithm's tendency to over-copy or under-copy training data by manipulating the average sequence length saved in the dictionary.
Related
- Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
- On Twisted Roth-Lempel Codes
- Lempel-Ziv Parsing with Match-Length-Dependent Windows: Universality and Limits
- Sequential versus fully conditional specification for tree-based synthesis of health data
- From Yoneda to the Kernel Trick, from Sheaves to SVD: Ideas for Music Generation
BibTeX
@misc{mishan2026copying,
title = {{Copying Versus Randomization in Lempel-Ziv Music Synthesis}},
author = {Nadav Mishan and Ram Zamir},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.11353},
eprint = {2609.11353},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11353},
}
RIS
TY - UNPB
TI - Copying Versus Randomization in Lempel-Ziv Music Synthesis
AU - Nadav Mishan
AU - Ram Zamir
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2609.11353
UR - https://arxiv.org/abs/2609.11353
AB - We utilize Lempel-Ziv universal compression for music note generation. We control the algorithm's tendency to over-copy or under-copy training data by manipulating the average sequence length saved in the dictionary.
ER -