Jump to content

Shannon's source coding theorem: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

11 May 2025

23 January 2025

2 May 2024

30 October 2023

28 August 2023

23 August 2023

  • curprev 07:2607:26, 23 August 2023 Wikiwoosh talk contribs 12,220 bytes +1,151 The first sentence of the article contained the phrase "Shannon's source coding theorem (...) establishes the limits to possible data compression". However, this is only true for the case where the source is an i.i.d. random variable. Specific theorems and examples that show that data can be compressed beyond the Shannon limit for non-i.i.d. data are provided in Shen et al., "Kolmogorov Complexity and Algorithmic Randomness". I added the reference and an explanation to the introduction. undo

8 August 2023

19 July 2023

4 July 2023

19 March 2023

22 May 2022

19 May 2022

30 March 2022

19 March 2022

26 February 2022

6 February 2022

12 November 2021

2 August 2021

25 February 2021

8 June 2020

5 May 2020

21 February 2020

7 January 2020

1 June 2019

5 March 2019

26 December 2018

16 December 2018

15 December 2018

23 April 2018

23 November 2017

22 November 2017

30 June 2017

14 March 2016

11 March 2016

19 April 2015

18 April 2015

24 April 2014

28 February 2014

17 November 2013

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)