# Encoding

Encoding is the process and set of algorithms for converting data between bytes and scalar values, including standardized encodings such as UTF-8, with APIs exposed to JavaScript.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Building Ultra Long Range TOSLINK

DevFeed: [Building Ultra Long Range TOSLINK](<https://devfeed.tech/articles/building-ultra-long-range-toslink-41633.md>)

Original publisher: [Read original article](<https://blog.benjojo.co.uk/post/sfp-experiment-ultra-long-range-toslink>)

Author: ben@benjojo.co.uk

Published: 2025-01-07T12:24:27Z

Content type: article

Language: en

Sources: [benjojo blog](<https://devfeed.tech/sources/benjojo-blog.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [datacenter](<https://devfeed.tech/topics/datacenter.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>)

Tags: [computer](<https://devfeed.tech/tags/computer.md>), [data-transmission](<https://devfeed.tech/tags/data-transmission.md>), [datacenter](<https://devfeed.tech/tags/datacenter.md>), [encoding](<https://devfeed.tech/tags/encoding.md>)

### AI overview

A textual version of a talk exploring how optical data transmission works through SFP and QSFP modules, including their lanes, laser drivers, EEPROMs, microcontrollers, and advanced processing chips for higher-speed and longer-range links.

### Source excerpt

Building Ultra Long Range TOSLINK This post is a textual version of a talk I gave at The 38th Chaos Computer Congress at the end of 2024

## Encoding Schemes in FHE

DevFeed: [Encoding Schemes in FHE](<https://devfeed.tech/articles/encoding-schemes-in-fhe-40476.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2023/09/18/encoding-schemes-in-fhe/>)

Published: 2023-09-18T11:08:39Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Encoding](<https://devfeed.tech/topics/encoding.md>), [FHE](<https://devfeed.tech/topics/fhe.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>)

Tags: [bits](<https://devfeed.tech/tags/bits.md>), [complex-numbers](<https://devfeed.tech/tags/complex-numbers.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [learning-with-errors](<https://devfeed.tech/tags/learning-with-errors.md>), [lwe](<https://devfeed.tech/tags/lwe.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [number-theory](<https://devfeed.tech/tags/number-theory.md>), [programming](<https://devfeed.tech/tags/programming.md>), [residue-number-system](<https://devfeed.tech/tags/residue-number-system.md>), [rlwe](<https://devfeed.tech/tags/rlwe.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [scheme](<https://devfeed.tech/tags/scheme.md>)

### AI overview

This article explains how cleartexts are transformed into plaintexts through encoding, and reversed through decoding, in homomorphic encryption. It catalogs encoding approaches for different HE schemes, including bit-field encoding for LWE and considerations for noise, scaling, bit positions, and programmable bootstrapping in CGGI/TFHE.

### Source excerpt

In cryptography, we need a distinction between a cleartext and a plaintext. A cleartext is a message in its natural form. A plaintext is a cleartext that is represented in a specific way to prepare it for encryption in a specific scheme. The process of taking a cleartext and turning it into a plaintext is called encoding, and the reverse is called decoding. In homomorphic encryption, the distinction matters. Cleartexts are generally all integers, though the bit width of allowed integers can be restricted (e.

## Weird things I learned while writing an x86 emulator

DevFeed: [Weird things I learned while writing an x86 emulator](<https://devfeed.tech/articles/weird-things-i-learned-while-writing-an-x86-emulator-39728.md>)

Original publisher: [Read original article](<https://www.timdbg.com/posts/useless-x86-trivia/>)

Author: Tim Misiak

Published: 2023-02-02T07:54:20Z

Content type: article

Language: en

Sources: [TimDbg](<https://devfeed.tech/sources/timdbg.md>)

Topics: [Emulator](<https://devfeed.tech/topics/emulator.md>), [x86](<https://devfeed.tech/topics/x86.md>), [Assembly](<https://devfeed.tech/topics/assembly.md>), [cpu](<https://devfeed.tech/topics/cpu.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>), [debugging](<https://devfeed.tech/topics/debugging.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [execution](<https://devfeed.tech/topics/execution.md>)

Tags: [assembly](<https://devfeed.tech/tags/assembly.md>), [breakpoint](<https://devfeed.tech/tags/breakpoint.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [code](<https://devfeed.tech/tags/code.md>), [compilers](<https://devfeed.tech/tags/compilers.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [debugging](<https://devfeed.tech/tags/debugging.md>), [emulator](<https://devfeed.tech/tags/emulator.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [execution](<https://devfeed.tech/tags/execution.md>), [software](<https://devfeed.tech/tags/software.md>), [time-travel-debugging](<https://devfeed.tech/tags/time-travel-debugging.md>), [x86](<https://devfeed.tech/tags/x86.md>)

### AI overview

The author shares x86 and amd64 encoding trivia learned while writing a CPU emulator for Time Travel Debugging. The article explains why alternate instruction encodings matter for software breakpoints, code size, compiler behavior, and CPU understanding.

### Source excerpt

If you've read my first post about assembly language, you might expect that this is another post on how to understand assembly language. I will write more about that at some point, but this post is not that. Instead, this post is going to talk about some of the weird things and random trivia I learned while writing an x86 and amd64 emulator. The emulator I wrote was for Time Travel Debugging.

## JPEG Is a Family of Formats With Different Decoding Requirements

DevFeed: [JPEG Is a Family of Formats With Different Decoding Requirements](<https://devfeed.tech/articles/one-of-these-jpegs-is-not-like-the-other-41621.md>)

Original publisher: [Read original article](<https://blog.benjojo.co.uk/post/not-all-jpegs-are-the-same>)

Author: ben@benjojo.co.uk

Published: 2021-11-19T10:47:26Z

Content type: article

Language: en

Sources: [benjojo blog](<https://devfeed.tech/sources/benjojo-blog.md>)

Topics: [Encoding](<https://devfeed.tech/topics/encoding.md>), [format](<https://devfeed.tech/topics/format.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>), [Hardware](<https://devfeed.tech/topics/hardware.md>), [Software](<https://devfeed.tech/topics/software.md>), [hdmi](<https://devfeed.tech/topics/hdmi.md>), [intel](<https://devfeed.tech/topics/intel.md>)

Tags: [compression](<https://devfeed.tech/tags/compression.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [format](<https://devfeed.tech/tags/format.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [hdmi](<https://devfeed.tech/tags/hdmi.md>), [intel](<https://devfeed.tech/tags/intel.md>), [software](<https://devfeed.tech/tags/software.md>)

### AI overview

An exploration of JPEG as a family of formats rather than a single uniform format, focusing on hardware and software decoding, compression, and a failed attempt to transmit JPEG data through HDMI equipment.

### Source excerpt

One of these JPEGs is not like the other "JPEG" or the image encoding specification by the "Joint Photographic Experts Group" (JPEG) is a truly universal format at this stage. You really cannot go very far on the internet without seeing a JPEG file

## Practical Reed-Solomon for Programmers

DevFeed: [Practical Reed-Solomon for Programmers](<https://devfeed.tech/articles/practical-reed-solomon-for-programmers-36528.md>)

Original publisher: [Read original article](<https://berthub.eu/articles/posts/reed-solomon-for-programmers/>)

Published: 2021-06-13T04:38:15Z

Content type: tutorial

Language: en

Sources: [Bert Hubert's writings](<https://devfeed.tech/sources/bert-hubert-s-writings.md>)

Topics: [Encoding](<https://devfeed.tech/topics/encoding.md>), [math](<https://devfeed.tech/topics/math.md>), [Linux](<https://devfeed.tech/topics/linux.md>)

Tags: [advanced](<https://devfeed.tech/tags/advanced.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [math](<https://devfeed.tech/tags/math.md>), [practical](<https://devfeed.tech/tags/practical.md>), [programming](<https://devfeed.tech/tags/programming.md>)

### AI overview

A practical introduction to Reed-Solomon error-correcting codes for programmers. It explains how redundant parity symbols can recover corrupted or missing data, discusses protection limits and block sizes, and connects the topic to Galileo High Accuracy Service data.

### Source excerpt

Recently I was doing some work decoding the new Galileo High Accuracy Service data. In short, this new service will allow Galileo ("European GPS") users to achieve decimeter-level accuracy, which is nice. This "HAS" data is transmitted highly redundantly by making good use of Reed-Solomon encoding. To work with this data, I attempted to learn more about Reed-Solomon and I found almost all explanations were useless to me - oodles of advanced math, but no guidance of how to use R-S in practice.

## Encoding data in dubstep drops

DevFeed: [Encoding data in dubstep drops](<https://devfeed.tech/articles/encoding-data-in-dubstep-drops-41602.md>)

Original publisher: [Read original article](<https://blog.benjojo.co.uk/post/encoding-data-into-dubstep-drops>)

Author: ben@benjojo.co.uk

Published: 2018-04-12T11:38:28Z

Content type: tutorial

Language: en

Sources: [benjojo blog](<https://devfeed.tech/sources/benjojo-blog.md>)

Topics: [Encoding](<https://devfeed.tech/topics/encoding.md>), [data](<https://devfeed.tech/topics/data.md>), [Code](<https://devfeed.tech/topics/code.md>), [digital](<https://devfeed.tech/topics/digital.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [computer](<https://devfeed.tech/tags/computer.md>), [data](<https://devfeed.tech/tags/data.md>), [dsp](<https://devfeed.tech/tags/dsp.md>), [encoding](<https://devfeed.tech/tags/encoding.md>)

### AI overview

A technical walkthrough of embedding machine-readable data into a dubstep track while preserving an audible listening experience. It explains using frequency bands and inverted waveforms to create two distinguishable states, then recombining the bassline and upper frequencies into a playable audio file.

### Source excerpt

Encoding data in dubstep drops [Warning: Those who can't stand EDM/dubstep, oh boy do I have bad news for you in regards to this blog post] Dubstep songs are often criticized as sounding extremely computer generated and often just too aggressi

## Hamming's Code

DevFeed: [Hamming's Code](<https://devfeed.tech/articles/hamming-s-code-40378.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/03/02/hammings-code/>)

Published: 2015-03-02T09:00:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>), [digital](<https://devfeed.tech/topics/digital.md>)

Tags: [coding-theory](<https://devfeed.tech/tags/coding-theory.md>), [compression](<https://devfeed.tech/tags/compression.md>), [computing](<https://devfeed.tech/tags/computing.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [error](<https://devfeed.tech/tags/error.md>), [errors](<https://devfeed.tech/tags/errors.md>), [finite-fields](<https://devfeed.tech/tags/finite-fields.md>), [hamming](<https://devfeed.tech/tags/hamming.md>), [hamming-code](<https://devfeed.tech/tags/hamming-code.md>), [hypercube](<https://devfeed.tech/tags/hypercube.md>), [information-theory](<https://devfeed.tech/tags/information-theory.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [linear-codes](<https://devfeed.tech/tags/linear-codes.md>), [np-hard](<https://devfeed.tech/tags/np-hard.md>), [reed-solomon-codes](<https://devfeed.tech/tags/reed-solomon-codes.md>), [solved](<https://devfeed.tech/tags/solved.md>), [transmission](<https://devfeed.tech/tags/transmission.md>)

### AI overview

This tutorial introduces Hamming codes as efficiently computable encoding schemes for detecting and correcting errors caused by noise during digital transmission. It defines a code as a subset of binary strings and relates codewords to an injective encoding function.

### Source excerpt

Or how to detect and correct errors Last time we made a quick tour through the main theorems of Claude Shannon, which essentially solved the following two problems about communicating over a digital channel. What is the best encoding for information when you are guaranteed that your communication channel is error free? Are there any encoding schemes that can recover from random noise introduced during transmission? The answers to these questions were purely mathematical theorems, of course.

## A Proofless Introduction to Information Theory

DevFeed: [A Proofless Introduction to Information Theory](<https://devfeed.tech/articles/a-proofless-introduction-to-information-theory-40377.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/02/16/a-proofless-introduction-to-information-theory/>)

Published: 2015-02-16T09:00:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Encoding](<https://devfeed.tech/topics/encoding.md>), [digital](<https://devfeed.tech/topics/digital.md>)

Tags: [channel](<https://devfeed.tech/tags/channel.md>), [coding-theory](<https://devfeed.tech/tags/coding-theory.md>), [communication](<https://devfeed.tech/tags/communication.md>), [compression](<https://devfeed.tech/tags/compression.md>), [digital](<https://devfeed.tech/tags/digital.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [error](<https://devfeed.tech/tags/error.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [example](<https://devfeed.tech/tags/example.md>), [explain](<https://devfeed.tech/tags/explain.md>), [hamming](<https://devfeed.tech/tags/hamming.md>), [independent](<https://devfeed.tech/tags/independent.md>), [information](<https://devfeed.tech/tags/information.md>), [information-theory](<https://devfeed.tech/tags/information-theory.md>), [kolmogorov-complexity](<https://devfeed.tech/tags/kolmogorov-complexity.md>), [language](<https://devfeed.tech/tags/language.md>), [markov](<https://devfeed.tech/tags/markov.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [messages](<https://devfeed.tech/tags/messages.md>), [models](<https://devfeed.tech/tags/models.md>), [probabilistic-method](<https://devfeed.tech/tags/probabilistic-method.md>), [problems](<https://devfeed.tech/tags/problems.md>), [shannon](<https://devfeed.tech/tags/shannon.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

A proofless introduction to information theory explains noiseless and noisy communication problems, encoding schemes, entropy, and how entropy differs from Kolmogorov complexity.

### Source excerpt

There are two basic problems in information theory that are very easy to explain. Two people, Alice and Bob, want to communicate over a digital channel over some long period of time, and they know the probability that certain messages will be sent ahead of time. For example, English language sentences are more likely than gibberish, and "Hi" is much more likely than "asphyxiation." The problems are: Say communication is very expensive.