Knowledge

Template talk:Infobox code

Source 📝

42:, which one do we want to give? Do we only want to distinguish between linear/nonlinear block codes, convolutional codes, and probably rateless codes? For example, the class hierarchy of RS codes may be given as RS codes ⊂ BCH codes ⊂ cyclic codes ⊂ polynomial codes ⊂ linear block codes. Or do want to indicate the next class of codes in such hierarchy? Do we want to point out particular 514:
Nice, thanks! I'm not sure I like that the lists for the notation are collapsed, but it's definitely better than just having a link. In your example, things seem a bit squeezed, especially the show/hide buttons: on my computer, they are at a very small distance below 'Linear block code' and below the
79:
was very confusing to me at first. The redundancy of the infoboxes is for non-experts who do not want to decipher this notation to find out what's going on. Going one click and doing pattern matching with the four symbols is simply not a thing that I want to do. If you want to reduce redundancy with
1190:
Collapsible text is neat, but there seems to be no good solution for this template, especially since one cannot change the clickable text that appears to or the collapsible text. Your draft2 looks pretty good other than that. Below is a new draft; while I think simply noting the Notation would be
807:
I find this situation highly confusing and wikipedia should make it as easy as possible for the reader to understand what is meant. In a paper or in a textbook, we can define the notation in the beginning, but on wikipedia we cannot do that. Therefore, I'd prefer the notation list to be shown by
518:
Why exactly do you want the explanation for the notation to be collapsed by default? I know that this adds four lines to the infobox, but there is hardly a lack of space, and I don't think it counts as clutter either. Even though this notation claims to be a standard, the truth is that different
37:
reveals any further information required to interpret its parameters. Second, the box does not consider convolutional codes, which are defined by constraint length rather than block length and message length, or rateless codes, which do not have a predetermined block length or code rate at all.
46:, like whether the code is perfect, whether it is optimal (MDS code), or that particularly efficient algorithms exist (like for Fountain codes, which are linearly en-/decodable)? Other than that, I think the principal idea of an infobox for codes has some appeal. 118:, but I am not sure this is the best thing to do. Having a mechanism to display the hierarchy to which the codes belong would be nice. It would also be nice to have information about further combinatorial and algorithmic properties of the codes. 75:. After all, I wanted to present the data in such a way that the interested wikipedia reader can decode and understand it easily. Redundancy helps here a lot. I am not a coding theorist myself, for which reason I know that the 121:
If you have an idea about how to accommodate other code types, please go ahead and add the entries to the infobox template. Remember that this is fine since the entries of the template are optional.
746: 114:
in mind. Maybe this infobox should really be an infobox for block codes. I've added the box only to block codes so far, and I do not plan to add it to non-block codes. As types I've always chosen
1123: 442: 1195:
to learn about it), I have left in the details as a courtesy. Btw, (n,k) is a notation used for any code, whether linear block, non-linear block, or convolutional code. Have a look!
953: 61:
Thank you for your message! I am sorry that you are not happy with the infobox. You bring up two issues that I am also not entirely happy with, but I think it's a good start.
793: 632: 1066: 998: 385: 317: 270: 1026: 345: 509: 817: 84:
field. The only other type of redundancy is that the rate is determined by the message length and the block length. In numerical cases like the
515:
bracket notation. How about more something like this test box. Ideally, I would like the hierarchy elements and the notation to be centered.
92:
were the parameters are just k and n, it's indeed a bit silly to write k/n, but if someone's really unhappy with this, they can edit
1219: 1415: 1172: 482: 639: 21:
I'm not too happy with this infobox. For one, it contains excessive redundant information. IMO it suffices to include
1391: 1141: 458: 1079: 398: 132: 1371: 55: 1204: 504: 1148: 899: 104: 753: 525: 1401: 1158: 468: 1298: 1004: 323: 1327: 1072: 391: 1281: 1039: 971: 964: 358: 290: 283: 8: 1375: 1185: 218: 138: 1348: 211: 34: 1310: 1032: 1011: 351: 330: 1255: 857: 849: 168: 115: 93: 89: 16: 1191:
fine since (n,k) and are so widespread in coding theory (and anyone can click on
1259: 1240: 1215: 1200: 864: 837: 813: 500: 195: 158: 128: 51: 1236: 833: 495:
This is a quick sketch for testing a different presentation. Comments welcome.
154: 65: 85: 1263: 869: 191: 1211: 1196: 809: 496: 124: 111: 47: 1267: 1192: 874: 187: 519:
authors and different areas use many variations of this notation:
71:
I agree that there is some redundancy, but I wouldn't call it
88:, I think it's nice to see the number. In cases like the 1082: 1042: 1014: 974: 902: 756: 642: 528: 401: 361: 333: 293: 221: 741:{\displaystyle (n,k,d)_{q},(n,k,d),(n,k)_{q},(n,k)} 1117: 1060: 1020: 992: 947: 787: 740: 626: 436: 379: 339: 311: 264: 935: 904: 80:the notation, then I am in favor of deleting the 33:- for block codes, at least. A single click on 1409: 1166: 476: 1118:{\displaystyle q=p^{m}\ (p{\text{ prime}})} 437:{\displaystyle q=p^{m}\ (p{\text{ prime}})} 1416: 1402: 1173: 1159: 510:Draft2: with headers and collapsible lists 483: 469: 13: 14: 1434: 939: 931: 928: 925: 922: 919: 916: 913: 910: 907: 1392:Maximum-distance separable code 1142:Maximum distance separable code 948:{\displaystyle \mathbf {_{q}} } 110:Indeed I designed the box with 1112: 1101: 776: 757: 735: 723: 711: 698: 692: 674: 662: 643: 621: 609: 597: 584: 578: 560: 548: 529: 431: 420: 253: 222: 1: 1220:18:37, 30 October 2011 (UTC) 1205:17:34, 30 October 2011 (UTC) 818:16:33, 26 October 2011 (UTC) 505:22:21, 25 October 2011 (UTC) 133:22:36, 23 October 2011 (UTC) 56:21:46, 23 October 2011 (UTC) 7: 788:{\displaystyle (n,M,d)_{q}} 627:{\displaystyle _{q},,_{q},} 10: 1439: 748:for non-linear block codes 1397: 1390: 1385: 1367: 1362: 1347: 1326: 1309: 1297: 1280: 1275: 1251: 1246: 1232: 1227: 1210:That looks good, thanks! 1154: 1147: 1140: 1135: 1071: 1031: 1003: 963: 893: 888: 848: 843: 829: 824: 464: 454: 390: 350: 322: 282: 275: 210: 181: 174: 164: 150: 145: 1119: 1062: 1022: 994: 949: 789: 742: 634:for linear block codes 628: 438: 381: 341: 313: 266: 1120: 1063: 1061:{\displaystyle n-k+1} 1023: 995: 993:{\displaystyle n=q-1} 950: 790: 743: 629: 439: 382: 380:{\displaystyle n-k+1} 342: 314: 312:{\displaystyle n=q-1} 267: 1080: 1040: 1012: 972: 900: 754: 640: 526: 399: 359: 331: 291: 265:{\displaystyle _{q}} 219: 1149:List-decodable code 1228:Reed–Solomon codes 1115: 1058: 1018: 990: 945: 825:Reed–Solomon codes 799:non-linear, block 795:, etc. for linear 785: 738: 624: 434: 377: 337: 309: 262: 146:Reed–Solomon codes 1426: 1425: 1271:Reed–Solomon code 1256:Linear block code 1183: 1182: 1128: 1127: 1110: 1100: 1021:{\displaystyle k} 880:Reed–Solomon code 858:Linear block code 850:Linear block code 493: 492: 447: 446: 429: 419: 340:{\displaystyle k} 203: 202: 199:Linear block code 185:Reed–Solomon code 169:Linear block code 116:linear block code 94:Reed-Solomon code 90:Reed-Solomon code 1430: 1418: 1411: 1404: 1372:Berlekamp–Massey 1225: 1224: 1175: 1168: 1161: 1124: 1122: 1121: 1116: 1111: 1108: 1099: 1098: 1097: 1067: 1065: 1064: 1059: 1027: 1025: 1024: 1019: 999: 997: 996: 991: 961: 960: 954: 952: 951: 946: 944: 943: 942: 822: 821: 803:non-block codes. 794: 792: 791: 786: 784: 783: 747: 745: 744: 739: 719: 718: 670: 669: 633: 631: 630: 625: 605: 604: 556: 555: 485: 478: 471: 443: 441: 440: 435: 430: 427: 418: 417: 416: 386: 384: 383: 378: 346: 344: 343: 338: 318: 316: 315: 310: 280: 279: 271: 269: 268: 263: 261: 260: 179: 178: 143: 142: 77:popular notation 1438: 1437: 1433: 1432: 1431: 1429: 1428: 1427: 1422: 1357: 1260:Polynomial code 1241:Gustave Solomon 1188: 1179: 1131: 1107: 1093: 1089: 1081: 1078: 1077: 1041: 1038: 1037: 1013: 1010: 1009: 973: 970: 969: 957: 956: 938: 934: 903: 901: 898: 897: 884: 865:Polynomial code 861: 860: 838:Gustave Solomon 779: 775: 755: 752: 751: 714: 710: 665: 661: 641: 638: 637: 600: 596: 551: 547: 527: 524: 523: 512: 489: 450: 426: 412: 408: 400: 397: 396: 360: 357: 356: 332: 329: 328: 292: 289: 288: 256: 252: 220: 217: 216: 206: 196:Polynomial code 159:Gustave Solomon 141: 107: 96:and delete the 68: 38:Regarding code 19: 12: 11: 5: 1436: 1424: 1423: 1421: 1420: 1413: 1406: 1398: 1395: 1394: 1388: 1387: 1383: 1382: 1378: 1374: 1369: 1365: 1364: 1360: 1359: 1353: 1351: 1345: 1344: 1330: 1324: 1323: 1313: 1307: 1306: 1301: 1299:Message length 1295: 1294: 1284: 1278: 1277: 1273: 1272: 1270: 1266: 1262: 1258: 1253: 1249: 1248: 1247:Classification 1244: 1243: 1237:Irving S. Reed 1234: 1230: 1229: 1223: 1222: 1187: 1184: 1181: 1180: 1178: 1177: 1170: 1163: 1155: 1152: 1151: 1145: 1144: 1138: 1137: 1133: 1132: 1130: 1129: 1126: 1125: 1114: 1106: 1103: 1096: 1092: 1088: 1085: 1075: 1069: 1068: 1057: 1054: 1051: 1048: 1045: 1035: 1029: 1028: 1017: 1007: 1005:Message length 1001: 1000: 989: 986: 983: 980: 977: 967: 941: 937: 933: 930: 927: 924: 921: 918: 915: 912: 909: 906: 896: 895: 894: 891: 890: 886: 885: 883: 882: 877: 872: 867: 856: 855: 854: 852: 846: 845: 841: 840: 834:Irving S. Reed 831: 827: 826: 805: 804: 782: 778: 774: 771: 768: 765: 762: 759: 749: 737: 734: 731: 728: 725: 722: 717: 713: 709: 706: 703: 700: 697: 694: 691: 688: 685: 682: 679: 676: 673: 668: 664: 660: 657: 654: 651: 648: 645: 635: 623: 620: 617: 614: 611: 608: 603: 599: 595: 592: 589: 586: 583: 580: 577: 574: 571: 568: 565: 562: 559: 554: 550: 546: 543: 540: 537: 534: 531: 511: 508: 491: 490: 488: 487: 480: 473: 465: 462: 461: 456: 452: 451: 449: 448: 445: 444: 433: 425: 422: 415: 411: 407: 404: 394: 388: 387: 376: 373: 370: 367: 364: 354: 348: 347: 336: 326: 324:Message length 320: 319: 308: 305: 302: 299: 296: 286: 276: 273: 272: 259: 255: 251: 248: 245: 242: 239: 236: 233: 230: 227: 224: 214: 208: 207: 205: 204: 201: 200: 198: 194: 190: 186: 183: 175: 172: 171: 166: 162: 161: 155:Irving S. Reed 152: 148: 147: 140: 137: 136: 135: 122: 119: 106: 103: 102: 101: 67: 64: 63: 62: 18: 15: 9: 6: 4: 3: 2: 1435: 1419: 1414: 1412: 1407: 1405: 1400: 1399: 1396: 1393: 1389: 1384: 1381: 1377: 1373: 1370: 1366: 1361: 1356: 1352: 1350: 1346: 1342: 1338: 1334: 1331: 1329: 1328:Alphabet size 1325: 1321: 1317: 1314: 1312: 1308: 1305: 1302: 1300: 1296: 1292: 1288: 1285: 1283: 1279: 1274: 1269: 1265: 1261: 1257: 1254: 1250: 1245: 1242: 1238: 1235: 1231: 1226: 1221: 1217: 1213: 1209: 1208: 1207: 1206: 1202: 1198: 1194: 1176: 1171: 1169: 1164: 1162: 1157: 1156: 1153: 1150: 1146: 1143: 1139: 1134: 1104: 1094: 1090: 1086: 1083: 1076: 1074: 1073:Alphabet size 1070: 1055: 1052: 1049: 1046: 1043: 1036: 1034: 1030: 1015: 1008: 1006: 1002: 987: 984: 981: 978: 975: 968: 966: 962: 959: 958: 892: 887: 881: 878: 876: 873: 871: 868: 866: 863: 862: 859: 853: 851: 847: 842: 839: 835: 832: 828: 823: 820: 819: 815: 811: 802: 798: 780: 772: 769: 766: 763: 760: 750: 732: 729: 726: 720: 715: 707: 704: 701: 695: 689: 686: 683: 680: 677: 671: 666: 658: 655: 652: 649: 646: 636: 618: 615: 612: 606: 601: 593: 590: 587: 581: 575: 572: 569: 566: 563: 557: 552: 544: 541: 538: 535: 532: 522: 521: 520: 516: 507: 506: 502: 498: 486: 481: 479: 474: 472: 467: 466: 463: 460: 457: 453: 423: 413: 409: 405: 402: 395: 393: 392:Alphabet size 389: 374: 371: 368: 365: 362: 355: 353: 349: 334: 327: 325: 321: 306: 303: 300: 297: 294: 287: 285: 281: 278: 277: 274: 257: 249: 246: 243: 240: 237: 234: 231: 228: 225: 215: 213: 209: 197: 193: 189: 184: 180: 177: 176: 173: 170: 167: 163: 160: 156: 153: 149: 144: 134: 130: 126: 123: 120: 117: 113: 109: 108: 99: 95: 91: 87: 83: 78: 74: 70: 69: 60: 59: 58: 57: 53: 49: 45: 41: 36: 32: 28: 24: 1408: 1379: 1354: 1340: 1336: 1332: 1319: 1315: 1303: 1290: 1286: 1282:Block length 1189: 1165: 965:Block length 879: 806: 800: 796: 517: 513: 494: 475: 284:Block length 97: 86:Hamming(7,4) 81: 76: 72: 66:Redundancies 43: 39: 30: 26: 22: 20: 1264:Cyclic code 1233:Named after 870:Cyclic code 830:Named after 192:Cyclic code 151:Named after 112:block codes 23:Named after 1386:Properties 1363:Algorithms 1276:Parameters 1136:Properties 889:Parameters 105:Code types 44:properties 1376:Euclidean 1252:Hierarchy 844:Hierarchy 808:default. 182:Hierarchy 73:excessive 17:Not happy 1368:Decoding 1349:Notation 1311:Distance 1268:BCH code 1193:Notation 1033:Distance 875:BCH code 459:MDS code 352:Distance 212:Notation 188:BCH code 82:notation 35:notation 31:Notation 455:Remarks 1380:et al. 1343:prime) 1186:Draft3 955:-code 139:Draft1 100:entry. 29:, and 1358:-code 1212:ylloh 1197:Nageh 1109:prime 810:ylloh 497:Nageh 428:prime 125:ylloh 48:Nageh 1239:and 1216:talk 1201:talk 836:and 814:talk 501:talk 165:Type 157:and 129:talk 98:rate 52:talk 40:type 27:Type 1322:+ 1 1293:- 1 801:and 797:and 1335:= 1318:- 1289:= 1218:) 1203:) 1047:− 985:− 923:− 816:) 503:) 366:− 304:− 241:− 131:) 54:) 25:, 1417:e 1410:t 1403:v 1355:q 1341:p 1339:( 1337:p 1333:q 1320:k 1316:n 1304:k 1291:q 1287:n 1214:( 1199:( 1174:e 1167:t 1160:v 1113:) 1105:p 1102:( 1095:m 1091:p 1087:= 1084:q 1056:1 1053:+ 1050:k 1044:n 1016:k 988:1 982:q 979:= 976:n 940:q 936:] 932:1 929:+ 926:k 920:n 917:, 914:k 911:, 908:n 905:[ 812:( 781:q 777:) 773:d 770:, 767:M 764:, 761:n 758:( 736:) 733:k 730:, 727:n 724:( 721:, 716:q 712:) 708:k 705:, 702:n 699:( 696:, 693:) 690:d 687:, 684:k 681:, 678:n 675:( 672:, 667:q 663:) 659:d 656:, 653:k 650:, 647:n 644:( 622:] 619:k 616:, 613:n 610:[ 607:, 602:q 598:] 594:k 591:, 588:n 585:[ 582:, 579:] 576:d 573:, 570:k 567:, 564:n 561:[ 558:, 553:q 549:] 545:d 542:, 539:k 536:, 533:n 530:[ 499:( 484:e 477:t 470:v 432:) 424:p 421:( 414:m 410:p 406:= 403:q 375:1 372:+ 369:k 363:n 335:k 307:1 301:q 298:= 295:n 258:q 254:] 250:1 247:+ 244:k 238:n 235:, 232:k 229:, 226:n 223:[ 127:( 50:(

Index

notation
Nageh
talk
21:46, 23 October 2011 (UTC)
Hamming(7,4)
Reed-Solomon code
Reed-Solomon code
block codes
linear block code
ylloh
talk
22:36, 23 October 2011 (UTC)
Irving S. Reed
Gustave Solomon
Linear block code
BCH code
Cyclic code
Polynomial code
Notation
Block length
Message length
Distance
Alphabet size
MDS code
v
t
e
Nageh
talk
22:21, 25 October 2011 (UTC)

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.