有噪信道编码定理/edithistory
跳到导航
跳到搜索
oldid | date/time | username | edit summary |
---|---|---|---|
951753097 | 2020-04-18T18:13:16Z | Myxomatosis57 | |
948406703 | 2020-03-31T21:44:28Z | 223.228.149.21 | |
945811425 | 2020-03-16T08:17:46Z | Udo.bellack | /* Mathematical statement */ use math |
944391540 | 2020-03-07T15:42:07Z | 92.26.92.243 | /* References */Added missing date to reference. |
943645331 | 2020-03-03T03:01:10Z | Citation bot | Add: bibcode, hdl. Removed URL that duplicated unique identifier. | You can [[WP:UCB|use this bot]] yourself. [[WP:DBUG|Report bugs here]]. | Activated by [[User:AManWithNoPlan]] | via #UCB_webform |
943562417 | 2020-03-02T15:55:53Z | 63.118.38.246 | |
942900704 | 2020-02-27T15:53:28Z | 128.240.225.52 | Added the original reference for Shannon (1948) with link to pdf |
942898915 | 2020-02-27T15:40:11Z | 128.240.225.52 | The theorem was first published in Shannon's 1948 paper, and later in the co-authored book. The year for the paper is 1948, not 1949. |
940446737 | 2020-02-12T16:06:49Z | Magic links bot | Replace [[Help:Magic links|magic links]] with templates per [[Special:Permalink/772743896#Future of magic links|local RfC]] and [[:mw:Requests for comment/Future of magic links|MediaWiki RfC]] |
940381681 | 2020-02-12T06:07:52Z | Mark.malewski | /* Description */ added "The Mathematical Theory of Communication" citation by Claude E. Shannon. |
938034210 | 2020-01-28T19:05:05Z | Myxomatosis57 | /* See also */ |
915139668 | 2019-09-11T13:06:28Z | The Anome | Adding [[Wikipedia:Short description|short description]]: "Limit on data transfer rate" ([[User:Galobtter/Shortdesc helper|Shortdesc helper]]) |
908003106 | 2019-07-26T18:50:36Z | Jarble | adding links to references using [[Google Scholar]] |
906618056 | 2019-07-17T01:37:51Z | MDDevice | Undid revision 906617740 by [[Special:Contributions/73.189.188.229|73.189.188.229]] ([[User talk:73.189.188.229|talk]]) |
906617740 | 2019-07-17T01:33:38Z | 73.189.188.229 | |
901899154 | 2019-06-15T02:07:27Z | Beland | convert HTML entities, punctuation (via [[WP:JWB]]) |
898351389 | 2019-05-23T00:12:39Z | 131.215.220.165 | /* Channel coding theorem for non-stationary memoryless channels */ |
875438398 | 2018-12-26T15:45:38Z | Fvultier | Information theory sidebar template. |
873678549 | 2018-12-14T12:42:22Z | 129.67.14.147 | expanded awgn appreviation |
871702910 | 2018-12-02T22:18:07Z | 149.142.48.185 | /* Weak converse for discrete memoryless channels */ |
868798404 | 2018-11-14T14:22:02Z | Moonkey | /* Mathematical statement */ Improved the opening of the section and added a better image |
867569174 | 2018-11-06T15:33:28Z | Fvultier | Increased image size. Improved readability of formulas. |
859517755 | 2018-09-14T14:57:35Z | WikicyclopediaUser | /* Overview */ Included reference for Feinstein |
845603577 | 2018-06-12T22:02:17Z | Comfr | Shannon limit redirects here. |
837437235 | 2018-04-20T20:21:42Z | AnomieBOT | [[User:AnomieBOT/docs/TemplateSubster|Substing templates]]: {{Redirect3}}. See [[User:AnomieBOT/docs/TemplateSubster]] for info. |
836428779 | 2018-04-14T19:29:04Z | Renard162 | /* External links */ |
836180846 | 2018-04-13T04:23:41Z | 117.211.90.155 | |
836180659 | 2018-04-13T04:21:13Z | 122.15.87.170 | |
826753460 | 2018-02-20T20:48:32Z | InternetArchiveBot | Rescuing 0 sources and tagging 1 as dead. #IABot (v1.6.2) |
790739118 | 2017-07-15T19:47:06Z | Deacon Vorbis | LaTeX spacing clean up, replaced: \, </math> → </math> (2) using [[Project:AWB|AWB]] |
787373287 | 2017-06-25T00:56:34Z | PrimeBOT | Replace [[Help:Magic_links|magic links]] with templates per [[Special:PermaLink/772743896#Future_of_magic_links|local RfC]] - [[User:PrimeBOT/13|BRFA]] |
753809655 | 2016-12-09T09:11:56Z | Kku | link [[mutual information]] using [[:en:User:Edward/Find link|Find link]] |
724137888 | 2016-06-07T10:56:44Z | Materialscientist | Reverted 2 edits by [[Special:Contributions/77.86.109.234|77.86.109.234]] identified as test/vandalism using [[WP:STiki|STiki]] |
724133304 | 2016-06-07T10:10:49Z | 77.86.109.234 | |
724133259 | 2016-06-07T10:10:20Z | 77.86.109.234 | |
724128371 | 2016-06-07T09:18:45Z | Materialscientist | Reverted 1 edit by [[Special:Contributions/77.86.109.234|77.86.109.234]] identified as test/vandalism using [[WP:STiki|STiki]] |
724127581 | 2016-06-07T09:09:32Z | 77.86.109.234 | |
715328885 | 2016-04-15T03:19:57Z | 174.3.155.181 | fixing wikilink for [[David J.C. MacKay]] |
711017201 | 2016-03-20T13:52:43Z | 2602:30A:C005:72B0:BD4A:FEF5:2FFF:EAE9 | /* Mathematical statement */ |
710771446 | 2016-03-18T23:22:27Z | BG19bot | Remove blank line(s) between list items per [[WP:LISTGAP]] to fix an accessibility issue for users of [[screen reader]]s. Do [[WP:GENFIXES]] and cleanup if needed. Discuss this at [[Wikipedia talk:WikiProject Accessibility#LISTGAP]] |
674398721 | 2015-08-03T17:48:24Z | Galoiserdos | /* Overview */ Added some info on the BiAWGN capacity claim |
643178391 | 2015-01-19T09:07:58Z | 129.132.4.131 | /* Achievability for discrete memoryless channels */ Added one line in the proof to clarify more on where the R comes in the exponent of the last line. |
639846261 | 2014-12-27T20:05:52Z | 86.152.236.108 | tidy references |
634741192 | 2014-11-20T21:01:25Z | 178.38.152.228 | It is not computability in the the technical sense |
620602910 | 2014-08-10T06:40:11Z | InfoTheorist | /* Strong converse for discrete memoryless channels */ Added a missing division by 2 in the exponent. |
615819100 | 2014-07-06T13:39:23Z | Renamed user 7hq09uwypo226qfc | |
608607591 | 2014-05-14T22:11:09Z | 24.61.9.54 | /* Overview */ |
607169071 | 2014-05-05T13:00:10Z | Yobot | [[WP:CHECKWIKI]] error fixes using [[Project:AWB|AWB]] (10093) |
604692541 | 2014-04-18T04:49:59Z | Quondum | /* See also */ bypassing redirect |
602040100 | 2014-03-31T00:52:46Z | Voidxor | /* See also */ Alphabetize list |
597318131 | 2014-02-27T03:01:59Z | 80.192.21.201 | deleted test by previous user. :) |
597237265 | 2014-02-26T15:54:42Z | 37.32.217.29 | i added two lines to prove a point to someone. I will delete the lines myself within three days of this change. Sorry for the inconvenience |
584977970 | 2013-12-07T11:01:05Z | Welsh | Link repair: IEEE Communication Letters -> IEEE Communications Letters - [[w:en:WP:RLR|You can help!]] |
582386219 | 2013-11-19T15:52:30Z | Mimbletrouser | /* Overview */ or -> and |
582386152 | 2013-11-19T15:51:59Z | Mimbletrouser | /* Overview */ wind two sentences together |
582385964 | 2013-11-19T15:50:17Z | Mimbletrouser | /* Overview */ or [[turbo code]]s |
581768901 | 2013-11-15T13:35:26Z | 129.132.57.154 | /* Strong converse for discrete memoryless channels */ The error does not go exponentially to 1 as there is a term Theta(1/n) |
560410013 | 2013-06-18T07:09:35Z | Manoguru | /* Outline of proof */ |
559838827 | 2013-06-14T07:21:54Z | 2001:67C:2198:101:819:1B77:249C:1BE7 | Linking an orphan article |
553561027 | 2013-05-05T00:27:47Z | 149.142.31.18 | /* Achievability for discrete memoryless channels */ |
540633231 | 2013-02-26T14:19:58Z | Addbot | [[User:Addbot|Bot:]] Migrating 8 interwiki links, now provided by [[Wikipedia:Wikidata|Wikidata]] on [[d:q2345282]] ([[User talk:Addbot|Report Errors]]) |
527503604 | 2012-12-11T10:19:09Z | Yobot | clean up, References after punctuation per [[WP:REFPUNC]] and [[WP:CITEFOOT]] using [[Project:AWB|AWB]] (8792) |
516184678 | 2012-10-05T17:57:48Z | Ptbotgourou | r2.7.2) (Robot: Adding [[fr:Deuxième théorème de Shannon]] |
508808819 | 2012-08-23T17:34:24Z | 111.194.122.191 | /* Mathematical statement */ |
504522734 | 2012-07-28T01:07:16Z | John Baez | /* Achievability for discrete memoryless channels */ |
496060902 | 2012-06-05T04:48:06Z | Dicklyon | /* Overview */ Shannon actual gave a constructive proof, I believe, so unless there's a source, this negative statement really doesn't belong |
495909372 | 2012-06-04T10:09:06Z | Manoguru | /* Overview */ sp |
492929138 | 2012-05-16T21:54:12Z | AvocatoBot | r2.7.1) (Robot: Adding [[vi:Định lý mã hóa trên kênh nhiễu]] |
457020336 | 2011-10-23T18:41:20Z | Geometry guy | subcat |
455002893 | 2011-10-11T07:43:59Z | 193.134.216.2 | Undid revision 453857414 by [[Special:Contributions/193.134.216.2|193.134.216.2]] ([[User talk:193.134.216.2|talk]]) - Why remove it? |
453857414 | 2011-10-04T08:03:49Z | 193.134.216.2 | |
451517332 | 2011-09-20T15:37:30Z | DRLB | /* Mathematical statement */ Correct definition of binary entropy function, but is this really right? |
436515639 | 2011-06-27T15:30:11Z | Jean-Christophe BENOIST | false interwiki. The relevant article [[fr:théorème du codage de canal]] does not exists (yet) |
425876872 | 2011-04-25T19:39:02Z | Snotbot | Fixing improperly nested section headings [[Wikipedia:Bots/Requests for approval/Snotbot 5|(task 5)]] |
418200976 | 2011-03-10T22:24:50Z | Dicklyon | Reverted 1 edit by [[Special:Contributions/79.68.77.46|79.68.77.46]] ([[User talk:79.68.77.46|talk]]) identified as [[WP:VAND|vandalism]] to last revision by Yobot. ([[WP:TW|TW]]) |
418194220 | 2011-03-10T21:37:05Z | 79.68.77.46 | |
404449775 | 2010-12-27T12:14:50Z | Yobot | clean up using [[Project:AWB|AWB]] (7513) |
403599658 | 2010-12-21T21:43:37Z | LokiClock | |
400532469 | 2010-12-04T19:22:33Z | 98.231.164.33 | /* See also */ added Shannon-Hartley theorm to see-also section. |
389341675 | 2010-10-07T16:10:45Z | Melcombe | /* Overview */ wikilink |
385760870 | 2010-09-19T18:09:20Z | 41.233.79.40 | |
380637119 | 2010-08-24T03:57:28Z | Dicklyon | degree of contamination is not without bound |
380636874 | 2010-08-24T03:55:48Z | Dicklyon | the capacity limit is not "given", but is computable |
380605010 | 2010-08-24T00:31:05Z | 83.255.43.237 | mentioning that the theorem was an analys of discrete data. |
380603574 | 2010-08-24T00:22:39Z | 83.255.43.237 | Some credits to the forerunners. |
353873254 | 2010-04-04T08:10:58Z | LutzL | Revert uncommented mangling of the formulas. Was this a more sophisticated form of vandalism? |
353743799 | 2010-04-03T15:59:03Z | 76.181.66.9 | /* Mathematical statement */ |
353743679 | 2010-04-03T15:58:18Z | 76.181.66.9 | /* Mathematical statement */ |
353743297 | 2010-04-03T15:55:46Z | 76.181.66.9 | /* Mathematical statement */ |
353743056 | 2010-04-03T15:54:22Z | 76.181.66.9 | /* Mathematical statement */ |
353095345 | 2010-03-31T04:16:44Z | Humanengr | format as math |
353095202 | 2010-03-31T04:15:32Z | Humanengr | format as math |
353094872 | 2010-03-31T04:12:33Z | Humanengr | punctuation inserted for proper pause |
353094635 | 2010-03-31T04:10:43Z | Humanengr | "applications" appears earlier in the sentence. |
349320629 | 2010-03-11T23:07:02Z | Giftlite | /* Channel coding theorem for non-stationary memoryless channels */ +: |
349320572 | 2010-03-11T23:06:42Z | Giftlite | rvv |
349316451 | 2010-03-11T22:44:04Z | 92.244.30.45 | /* Headline text */ |
349316270 | 2010-03-11T22:43:06Z | 92.244.30.45 | /* Overview */ |
348798675 | 2010-03-09T19:34:25Z | 129.97.98.178 | /* Weak converse for discrete memoryless channels */ |
348798318 | 2010-03-09T19:32:21Z | 129.97.98.178 | /* Weak converse for discrete memoryless channels */ |
345862816 | 2010-02-23T12:23:29Z | 114.181.136.109 | /* Achievability for discrete memoryless channels */ |
339315841 | 2010-01-22T09:00:37Z | The Anome | /* See also */ * [[Rate-distortion theory]] |
339315802 | 2010-01-22T09:00:11Z | The Anome | /* External links */ * [http://cnx.org/content/m10180/latest/ Shannon's Noisy Channel Coding Theorem] |
325959467 | 2009-11-15T10:41:31Z | Marcelo.jimenez | /* References */ Missing space |
287111894 | 2009-04-30T20:04:21Z | Giftlite | mv "See also" up |
287111802 | 2009-04-30T20:03:51Z | Giftlite | /* References */ wikify |
285728537 | 2009-04-23T21:28:06Z | Dicklyon | Reverted 1 edit by [[Special:Contributions/220.227.11.211|220.227.11.211]] identified as [[WP:VAND|vandalism]] to last revision by [[User:121.158.41.64|121.158.41.64]]. ([[WP:TW|TW]]) |
285702188 | 2009-04-23T18:53:24Z | 220.227.11.211 | /* Mathematical statement */ |
279133498 | 2009-03-23T12:09:30Z | 121.158.41.64 | /* Mathematical statement */ |
279133477 | 2009-03-23T12:09:17Z | 121.158.41.64 | /* Mathematical statement */ |
276576879 | 2009-03-11T19:41:03Z | VolkovBot | robot Adding: [[nl:Noisy-channel coderings theorema]] |
263075929 | 2009-01-09T23:49:52Z | Softy | |
259795788 | 2008-12-23T22:08:32Z | Dicklyon | Reverted 1 edit by [[Special:Contributions/129.74.156.70|129.74.156.70]]; We're talking about two different bounds here, and the inserted text applies only to one side. ([[WP:TW|TW]]) |
259793074 | 2008-12-23T21:51:19Z | 129.74.156.70 | /* Outline of proof */ |
252733573 | 2008-11-19T06:24:19Z | SilvonenBot | robot Adding: [[et:Kanali kodeerimise teoreem]] |
251358236 | 2008-11-12T16:03:54Z | 192.54.144.229 | /* Mathematical statement */ |
242409978 | 2008-10-02T03:12:16Z | C.Fred | Reverted edits by [[Special:Contributions/Vididsense|Vididsense]] ([[User talk:Vididsense|talk]]) to last version by ClueBot |
242409343 | 2008-10-02T03:08:38Z | Vididsense | spelling |
233317749 | 2008-08-21T13:13:07Z | ClueBot | Reverting possible vandalism by [[Special:Contributions/192.108.115.2|192.108.115.2]] to version by Looby45. False positive? [[User:ClueBot/FalsePositives|Report it]]. Thanks, [[User:ClueBot]]. (466127) (Bot) |
233317740 | 2008-08-21T13:13:03Z | 192.108.115.2 | /* References */ |
226823506 | 2008-07-20T15:48:07Z | Looby45 | /* Channel coding theorem for non-stationary memoryless channels */ fmt |
226823427 | 2008-07-20T15:47:31Z | Looby45 | /* Channel coding theorem for non-stationary memoryless channels */ fmt math |
226823280 | 2008-07-20T15:46:24Z | Looby45 | /* Outline of the proof */ in the [[asymptotic equipartition property]] article. |
226823206 | 2008-07-20T15:45:54Z | Looby45 | /* Outline of the proof */ fmt |
226823124 | 2008-07-20T15:45:18Z | Looby45 | /* Achievability for discrete memoryless channels */ fmt |
220677722 | 2008-06-21T01:04:12Z | The Anome | /* External links */ [[Category:Coding theory]] |
219797008 | 2008-06-16T22:28:59Z | ClueBot | Reverting possible vandalism by [[Special:Contributions/219.74.48.87|219.74.48.87]] to version by Giftlite. False positive? [[User:ClueBot/FalsePositives|Report it]]. Thanks, [[User:ClueBot]]. (420626) (Bot) |
219797000 | 2008-06-16T22:28:55Z | 219.74.48.87 | [[WP:AES|←]]Blanked the page |
217144675 | 2008-06-04T20:13:42Z | Giftlite | /* Channel coding theorem for non-stationary memoryless channels */ +. |
217131105 | 2008-06-04T19:06:03Z | SmackBot | Date the maintenance tags or general fixes |
213354448 | 2008-05-18T23:30:56Z | Dicklyon | Reverted to revision 211474029 by [[Special:Contributions/Dicklyon|Dicklyon]]; revert to version without the pure symbol-soup section; this is not what an encyclopedia article needs. ([[WP:TW|TW]]) |
213329396 | 2008-05-18T21:22:37Z | 69.110.23.51 | /* Achievability */ |
212740513 | 2008-05-16T01:19:43Z | Zotzilaha | /* Outline of the proof */ |
211474029 | 2008-05-10T15:16:43Z | Dicklyon | /* Mathematical statement */ |
184272479 | 2008-01-14T16:12:03Z | 68.181.219.90 | /* Weak converse for discrete memoryless channels */ |
183231959 | 2008-01-09T19:33:52Z | Dicklyon | moved [[Noisy channel coding theorem]] to [[Noisy-channel coding theorem]] over redirect: correct punctuation |
175504455 | 2007-12-03T16:12:52Z | Michael Hardy | /* Mathematical statement */ |
175504262 | 2007-12-03T16:11:51Z | Michael Hardy | /* Outline of proof */ |
175504088 | 2007-12-03T16:10:58Z | Michael Hardy | /* Outline of proof */ |
175503948 | 2007-12-03T16:10:10Z | Michael Hardy | /* Outline of proof */ |
175503817 | 2007-12-03T16:09:26Z | Michael Hardy | /* Outline of proof */ |
175503385 | 2007-12-03T16:07:12Z | Michael Hardy | /* Outline of Proof */ fixed this incorrect capital |
174758163 | 2007-11-30T03:56:45Z | CRGreathouse | [[WP:ALSO]] |
169365319 | 2007-11-05T12:31:27Z | Smalljim | Fixing [[Wikipedia:Disambiguation pages with links|links to disambiguation pages]] using [[Project:AutoWikiBrowser|AWB]] |
165229261 | 2007-10-17T18:15:04Z | Dicklyon | /* Achievability for discrete memoryless channels */ |
165208910 | 2007-10-17T16:28:34Z | 64.81.152.2 | /* Achievability for discrete memoryless channels */ minor grammer correction |
162880959 | 2007-10-07T15:39:28Z | Bkell | /* Overview */ capitalization &c. |
159987455 | 2007-09-24T10:51:48Z | 199.46.199.232 | |
159987428 | 2007-09-24T10:51:29Z | 199.46.199.232 | |
159954817 | 2007-09-24T05:32:26Z | Bkell | /* Overview */ de-emphasized math a bit, removed a couple of LDPC links |
157164936 | 2007-09-11T15:10:27Z | Dicklyon | revert to [[code rate]], which properly defines the meaning of rate here |
157129276 | 2007-09-11T10:53:28Z | Alinja | fixed link |
153990011 | 2007-08-27T17:31:37Z | Saibod | |
152923847 | 2007-08-22T14:15:41Z | Alinja | cat |
151465422 | 2007-08-15T20:54:42Z | COBot | robot Adding: [[it:Secondo teorema di Shannon]] |
143522836 | 2007-07-09T16:13:51Z | AlleborgoBot | robot Modifying: [[zh:有噪信道编码定理]] |
142109595 | 2007-07-02T22:32:07Z | Dicklyon | /* Overview */ need an infinite sequence of codes to get error arbitrarily small, or one per error rate |
142109264 | 2007-07-02T22:30:39Z | Dicklyon | not error free, but nearly so |
142101586 | 2007-07-02T21:54:59Z | Bahram.zahir | |
139328357 | 2007-06-20T00:48:26Z | Dicklyon | revert; the only merge discussion found was the old one that nobody supported because it's a bad idea |
139324773 | 2007-06-20T00:23:26Z | Mange01 | mergeto Shannon-hartley theorem |
139324354 | 2007-06-20T00:20:56Z | Mange01 | |
136548071 | 2007-06-07T07:43:36Z | 76.221.184.200 | /* Overview */ use at best -> use a best |
129822694 | 2007-05-10T14:07:23Z | Trellis | /* Overview */ |
129822081 | 2007-05-10T14:05:05Z | Trellis | |
125865605 | 2007-04-25T16:07:18Z | Trellis | |
125865414 | 2007-04-25T16:06:37Z | Trellis | |
123847150 | 2007-04-18T16:50:41Z | Dicklyon | /* Overview */ copyedit |
123840681 | 2007-04-18T16:24:13Z | 68.0.120.35 | mention how to calculate C |
115125245 | 2007-03-14T19:05:52Z | Dicklyon | /* Overview */ en dash |
115123214 | 2007-03-14T18:57:39Z | Dicklyon | /* Overview */ |
114732914 | 2007-03-13T05:18:57Z | Spoon! | /* Overview */ |
113180706 | 2007-03-06T23:21:00Z | Jheald | /* See also */ + source coding theorem |
111501896 | 2007-02-28T04:01:50Z | Cydebot | Robot - Removing category Claude Shannon per [[WP:CFD|CFD]] at [[Wikipedia:Categories for discussion/Log/2007 February 14]]. |
109850146 | 2007-02-21T17:18:02Z | 131.111.253.158 | /* References */ |
107079048 | 2007-02-10T14:13:19Z | 219.107.239.201 | /* External links */ +ja |
105077935 | 2007-02-02T12:36:15Z | 194.237.142.21 | |
101433425 | 2007-01-17T22:47:58Z | Dicklyon | rv; Linas, slow down and think about the content before replacing categories with less relevant ones |
101432886 | 2007-01-17T22:45:41Z | Linas | /* External links */ move to [[Category:Coding theory]] |
96726942 | 2006-12-27T11:53:56Z | Wullj | /* Overview */ |
96726112 | 2006-12-27T11:44:55Z | Wullj | /* References */ |
96726020 | 2006-12-27T11:43:52Z | Wullj | /* References */ |
96724902 | 2006-12-27T11:29:57Z | Wullj | /* Overview */ |
96724257 | 2006-12-27T11:21:45Z | Wullj | /* References */ |
96724157 | 2006-12-27T11:20:34Z | Wullj | /* References */ |
96724101 | 2006-12-27T11:19:49Z | Wullj | /* References */ |
96723848 | 2006-12-27T11:16:21Z | Wullj | /* References */ |
94131721 | 2006-12-13T20:56:32Z | Calbaer | /* Overview */ |
94117313 | 2006-12-13T19:47:43Z | 129.100.75.90 | /* Achievability for discrete memoryless channels */ |
94116766 | 2006-12-13T19:45:09Z | 129.100.75.90 | /* Overview */ italics, link |
93211704 | 2006-12-09T20:36:24Z | Chungc | /* References */ adding references |
93211370 | 2006-12-09T20:34:53Z | Chungc | /* Converse for discrete memoryless channels */ strong converse |
91073774 | 2006-11-30T03:25:04Z | Dicklyon | /* See also */ [[en dash]] |
83604934 | 2006-10-25T09:33:34Z | BertK | /* References */ +link to article |
76731982 | 2006-09-20T04:51:17Z | Cydebot | Robot - Emptying out deleted category Error-detection and correction. |
72377768 | 2006-08-28T12:35:53Z | SmackBot | ISBN formatting &/or general fixes using [[WP:AWB|AWB]] |
65930129 | 2006-07-26T09:33:40Z | Phr | /* See also */ rm [[super dense coding]], not related to this topic as far as i can tell. |
65714582 | 2006-07-25T08:01:51Z | Photonique | /* See also */ |
65714549 | 2006-07-25T08:01:26Z | Photonique | re-categorized |
63589434 | 2006-07-13T12:34:41Z | Hai Dang Quang~enwiki | /* Achievability for discrete memoryless channels */ bracketted formulea for proper display |
60809627 | 2006-06-27T09:22:14Z | Bornhj | rm inappropriate stub tag |
60144092 | 2006-06-23T09:13:19Z | The prophet wizard of the crayon cake | Reverted edits by [[Special:Contributions/212.219.56.214|212.219.56.214]] to last version by WikiC |
60143943 | 2006-06-23T09:11:26Z | 212.219.56.214 | /* Overview */ |
56535643 | 2006-06-02T18:24:42Z | WikiC~enwiki | /* See also */ |
55266305 | 2006-05-26T15:41:04Z | Deodar~enwiki | added new [[Category:Claude Shannon]] cat |
53948603 | 2006-05-19T00:06:57Z | Iseetho | /* Converse for discrete memoryless channels */ |
53947598 | 2006-05-19T00:00:11Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53947342 | 2006-05-18T23:58:33Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53947263 | 2006-05-18T23:57:55Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53947047 | 2006-05-18T23:56:22Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53946803 | 2006-05-18T23:54:25Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53946480 | 2006-05-18T23:51:57Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53945863 | 2006-05-18T23:47:23Z | Iseetho | /* Channel coding theorem for non-stationary memoryless channel */ |
53945236 | 2006-05-18T23:43:14Z | Iseetho | /* Overview */ |
53944544 | 2006-05-18T23:38:35Z | Iseetho | /* Overview */ |
53944219 | 2006-05-18T23:36:11Z | Iseetho | /* Channel coding theorem for non-stationary memoryless channel */ |
53943273 | 2006-05-18T23:29:38Z | 24.4.218.227 | /* Achievability for discrete memoryless channels */ |
53930061 | 2006-05-18T22:01:46Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53929843 | 2006-05-18T22:00:24Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53929418 | 2006-05-18T21:57:36Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53928790 | 2006-05-18T21:53:21Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53928492 | 2006-05-18T21:51:30Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53927829 | 2006-05-18T21:47:01Z | Iseetho | /* Achievability for discrete memoryless channels */ |
53927247 | 2006-05-18T21:43:02Z | Iseetho | |
53905111 | 2006-05-18T19:21:46Z | Phr | /* Mathematical statement */ rearrange equation |
53837412 | 2006-05-18T10:25:26Z | Pulkitgrover | /* Outline of the proof */ |
53837328 | 2006-05-18T10:24:33Z | Pulkitgrover | /* Channel coding theorem for non-stationary memoryless channel */ |
53837126 | 2006-05-18T10:22:24Z | Pulkitgrover | /* Channel coding theorem for non-stationary memoryless channel */ |
53836980 | 2006-05-18T10:20:28Z | Pulkitgrover | /* Channel coding theorem for non-stationary memoryless channel */ |
53808777 | 2006-05-18T04:44:02Z | Phr | /* Outline of Proof */ section-stub. the construction is missing! |
53738014 | 2006-05-17T20:08:33Z | Iseetho | /* References */ |
53737486 | 2006-05-17T20:05:25Z | Iseetho | added a short description of one style of proof of the coding theorem |
53629313 | 2006-05-17T03:53:54Z | WikiIT | /* See also */ |
53610205 | 2006-05-17T01:15:06Z | WikiIT | /* See also */ |
53567180 | 2006-05-16T20:26:08Z | 84.202.63.7 | www.tele.ntnu.no has changed name to www.iet.ntnu.no |
52174568 | 2006-05-08T18:01:18Z | 141.117.3.201 | /* Overview */ |
51586172 | 2006-05-04T21:58:51Z | NotQuiteEXPComplete | /* Mathematical statement */ |
50165199 | 2006-04-25T23:11:36Z | Calbaer | Corrected the inequality in the converse of the noisy-channel coding theorem |
48892055 | 2006-04-17T20:49:40Z | 24.137.220.64 | /* Mathematical statement */ |
46151230 | 2006-03-30T11:06:32Z | Mental Blank | Added definition of binary entropy |
36354015 | 2006-01-23T13:19:37Z | 130.94.162.61 | - |
32102103 | 2005-12-20T14:17:45Z | Jheald | /* Mathematical statement */ Shannon ref |
32031797 | 2005-12-20T00:01:36Z | Jheald | /* Summary */ + schemes |
32027547 | 2005-12-19T23:27:06Z | Jheald | |
32026328 | 2005-12-19T23:16:50Z | Jheald | /* External links */ |
32026276 | 2005-12-19T23:16:31Z | Jheald | + math-stub |
32025612 | 2005-12-19T23:11:15Z | Jheald | /* Summary */ |
32025463 | 2005-12-19T23:09:52Z | Jheald | Separated from Shannon-Hartley theorem |