Concurrent data transmission through analog speech channel using data hiding
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this letter, we propose to perform concurrent data transmissions through analog speech channels using a data hiding technique. In particular, concurrent data are modulated into a noise-like signal and imperceptibly embedded into voices. Conventional embedding methods usually treat speech as a source of interferences to the simultaneously transmitted data. The proposed scheme exploits the knowledge of the speech signal during embedding. Therefore, such an interference can be effectively removed, and a higher data rate can be achieved. Besides, the proposed scheme is compatible with conventional phone terminals. A conventional telephone set is still able to access the basic voice service, while the added decoding mechanism can extract the embedded data and provide various concurrent services. The performance of the proposed method is analyzed. Experimental results demonstrate that an acceptable data rate and bit-error rate can be achieved.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.006 |
| Open science | 0.004 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it