Differences

This shows you the differences between two versions of the page.

View differences: Side by SideInline Go

Link to this comparison view

Both sides previous revisionPrevious revision 2026/05/03 14:25 skander [Minimum required bits] 2026/05/02 21:21 skander [Minimum required bits] 2026/04/28 22:09 skander [Minimum required bits] 2026/04/28 21:59 skander 2026/04/28 21:30 skander 2026/04/28 21:00 skander createdGo		2026/05/03 14:25 skander [Minimum required bits] 2026/05/02 21:21 skander [Minimum required bits] 2026/04/28 22:09 skander [Minimum required bits] 2026/04/28 21:59 skander 2026/04/28 21:30 skander 2026/04/28 21:00 skander createdGo
data:packing [2026/05/02 21:21] – [Minimum required bits] skander		data:packing [2026/05/03 14:25] (current) – [Minimum required bits] skander
Line 7:		Line 7:
	===== Minimum required bits =====		===== Minimum required bits =====
-	Encoding information into binary digits, or bits, requires a coding scheme that specifies how to encode and decode said information.	+	Encoding information as binary digits, or bits, requires an encoding scheme that defines how values are mapped to bit patterns and how those bit patterns are decoded back into values.
-	To calculate the minimum number of bits required for encoding	+	For a finite set of possible values, the minimum fixed-width binary representation requires enough bits to uniquely encode every value. This bit width is determined by the cardinality of the value set.
	<code>		<code>
-	b = ⌈log₂(C)⌉	+	ceil(log2(number of possible values))
	</code>		</code>