Fri Mar 21 17:06:20 2014 UTClccn-n980841240.00Communication, control and computing : proceedings /0.861.00Man lacht nicht nur in Eriwan : Anekdoten und WItze aus dem real existierenden Sozialismus19000877n 98084124lccn-n93031230Blaum, Mario1951-lccn-n84802328International Business Machines CorporationResearch Divisionviaf-203696641Siegel, Paul H.lccn-no2011118316Bruck, Jehoshualccn-n82076631Basar, Tamerlccn-n84134986University of Illinois at Urbana-ChampaignDepartment of Electrical and Computer Engineeringnp-lafferty, john dLafferty, John D.np-roth, ron mRoth, Ron M.lccn-n82116324University of Illinois at Urbana-ChampaignCoordinated Science Laboratoryviaf-79060911Reve, Karel van het1921-1999rcpVardy, AlexanderConference proceedingsTelecommunication systemsSignal processingHebrew literatureEngineeringComputer engineeringComputational complexityCoding theoryData structures (Computer science)Decision treesUnited StatesElectronic digital computersElectronic data processing--Computer-assisted instructionPolitical scienceCanadaRadio broadcastingGermanyScientistsCivilizationSocial historyRussiansRadio LibertySoviet Union196319661969198419931994199719981801827621.382TK5101ocn798917760ocn4392537231306ocn039914129book19980.90Vardy, AlexanderCodes, curves, and signals : common threads in communicationsCodes, Curves, and Signals is a tribute to the broad and profound influence of Richard E. Blahut on the fields of algebraic coding, information theory, and digital signal processing. All the contributors have individually and collectively dedicated their work to R. E. Blahut. Codes, Curves, and Signals is an excellent reference for researchers and professionals interested in information theory and communications+-+0928387425222ocn019181944book19630.95Vardy, AlexanderPirtsah ba-ḳeraḥ82ocn005539975book19660.96Vardy, AlexanderDas Eisloch. (Aus dem Russischen)32ocn040420767book19980.73Lafferty, John DOrdered Binary Decision Diagrams and Minimal TrellisesOrdered binary decision diagrams (OBDDs) are graph based data structures for representing Boolean functions. They have found widespread use in computer aided design and in formal verification of digital circuits. Minimal trellises are graphical representations of error correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphical models, as follows. Let C be a binary code of length n, and let fc(x1, ..., xn) be the Boolean function that takes the value 0 at x1, ..., xn if and only if (x1, ..., xn)epsilonC. Given this natural one to one correspondence between Boolean functions and binary codes, we prove that the minimal proper trellis for a code C with minimum distance d> 1 is isomorphic to the single terminal OBDD for its Boolean indicator function fC(x1, ..., xn). Prior to this result, the extensive research during the past decade on binary decision diagrams in computer engineering and on minimal trellises in coding theory has been carried out independently. As outlined in this work, the realization that binary decision diagrams and minimal trellises are essentially the same data structure opens up a range of promising possibilities for transfer of ideas between these disciplines21ocn843426355book19841.00Man lacht nicht nur in Eriwan : Anekdoten und WItze aus dem real existierenden Sozialismus21ocn032261766book19940.47Blaum, MarioMDS array codes with independent parity symbolsAbstract: "A new family of MDS array codes is presented. The code arrays contain p information columns and r independent parity columns, each column consisting of p-1 bits, where p is a prime. We extend a previously known construction for the case r = 2 to three and more parity columns. It is shown that when r = 3 such extension is possible for any prime p. For larger values of r we give necessary and sufficient conditions for our codes to be MDS, and then prove that if p belongs to a certain class of primes these conditions are satisfied up to r = 8. One of the advantages of the new codes is that encoding and decoding may be accomplished using simple cyclic shifts and XOR operations on the columns of the code array. We develop efficient decoding procedures for the case of two and three column errors. This again extends the previously known results for the case of a single column error. Another primary advantage of our codes is related to the problem of efficient information updates. We present upper and lower bounds on the average number of parity bits which have to be updated in an MDS code over GF(2[superscript m]), following an update in a single information bit. This average number is of importance in many storage applications which require frequent updates of information. We show that the upper bound obtained from our codes is close to the lower bound and, most importantly, does not depend on the size of the code symbols. All these properties of the new MDS array codes make them very well suited for applications where the size of the code symbols is required to be large."21ocn032155198book19930.47Roth, Ron MHigh-order spectral-null codes : constructions and boundsAbstract: "Let S(n, k) denote the set of all sequences of length n over the alphabet [+1,-1], having a kth order spectral-null at zero frequency. A subset of S(n, k) is a spectral-null code of length n and order k. Upper and lower bounds on the cardinality of S(n, k) are derived. In particular we prove that O(2[superscript k] log₂ n) [> or =] n - log₂ [absolute value of S(n, k)] [> or =] O(k log₂ n) for infinitely many values of n. On the other hand we show that if n is not divisible by 2[superscript m] for m = [log₂ k] + 1, then S(n, k) is empty. Furthermore, bounds on the minimum Hamming distance d of S(n, k) are provided, showing that 2k [<or =] d [<or =] k(k-1)+2 for infinitely many n. We also investigate the minimum number of sign changes in a sequence [subset x] [element of] S(n, k) and provide an equivalent definition of S(n, k) in terms of the positions of these sign changes. An efficient algorithm for encoding arbitrary information sequences into a second-order spectral-null code of redundancy 3 log₂ n + O(log log n) is presented. Furthermore, we prove that the first nonzero moment of any sequence in S(n, k) is divisible by k! and then show how to construct a sequence with a spectral null of order k whose first nonzero moment is any even multiple of k!. This leads to an encoding scheme for spectral-null codes of length n and any fixed order k, with rate approaching unity as n [approaches] [infinity]."11ocn123401597mix0.47Vardy, AlexanderAlexander Vardy papersWritings, transcripts and sound recordings of Radio Liberty broadcasts, Radio Liberty memoranda and other internal documents, and reports, studies, newsletters, printed matter, and photographs, relating to Radio Liberty broadcasts to the Soviet Union, and to Soviet politics, culture and society11ocn493519254book1997Allerton Conference on Communication, Control and ComputingCommunication, control and computing : proceedings11ocn123337301book19940.47Thomas J. Watson IBM Research CenterBinary codes with large symbols11ocn060208207book1997Thirty-fifth annual Allerton conference on communication, control and computing : proceedings11ocn164707041book19660.10Vardy, AlexanderDas Eisloch (Prorub,dt.) Dt. [aus d. Russ.] v. Josef Hahn11ocn123337478book19930.47Thomas J. Watson IBM Research CenterThe Nordstrom-Robinson code: representation over GF(4) and efficient decoding12ocn045518485book19971.00Allerton Conference on Communication, Control, and ComputingProceedings : Thirty-fifth Annual Allerton Conference on Communication, Control, and Computing : conference held September 29, September 30, and October 1, 1997 Allerton House, Monticello, IllinoisConference proceedings11ocn123338097book19940.47Thomas J. Watson IBM Research CenterConservative arrays: multi-dimensional modulation codes for holographic recording11ocn798917760book1969Vardy, AlexanderBrieven van Alexander Vardy aan Karel van het Reve (1921-1999)11ocn123337470book19930.47Thomas J. Watson IBM Research CenterThe uniqueness of the Best code11ocn670431644art19980.10Vardy, Alexander: error-correcting codesBiographyDirectories+-+0928387425+-+0928387425Fri Mar 21 15:59:25 EDT 2014batch12781