![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
This table just represent what the excess is when k is 8, (for a 16 bit representation), however it is possible to find models where the excess is not the half of the available bits. In this case, a table is useful to show that. Sistemx (talk) 10:11, 22 January 2020 (UTC)
As it stands, the entire "Related codes" section is useless due to a lack of information and context for the tables. —MIGUELbM 09:01, 7 January 2022 (UTC)
Is 2n-1 for an n-bit number really the most common case, or is it excess-3, i.e., 4 bits with an offset of 3, used to simplify decimal adders? Either way, the article should cite an RS. -- Shmuel (Seymour J.) Metz Username:Chatul (talk) 16:02, 23 June 2025 (UTC)