Error Correcting Coding and Security for Data Networks
Home > Reference > Research and information: general > Coding theory and cryptology > Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept

Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

Error correcting coding is often analyzed in terms of its application to the separate levels within the data network in isolation from each other.  In this fresh approach, the authors consider the data network as a superchannel (a multi-layered entity) which allows error correcting coding to be evaluated as it is applied to a number of  network layers as a whole.  By exposing the problems of applying error correcting coding in data networks, and by discussing coding theory and its applications, this original technique shows how to correct errors in the network through joint coding at different network layers. Discusses the problem of reconciling coding applied to different layers using a  superchannel approach Includes thorough coverage of all the key codes: linear block codes, Hamming, BCH and Reed-Solomon codes, LDPC codes decoding, as well as convolutional, turbo and iterative coding Considers new areas of application of error correcting codes such as transport coding, code-based cryptosystems and coding for image compression Demonstrates how to use error correcting coding to control such important data characteristics as mean message delay Provides theoretical explanations backed up by numerous real-world examples and practical recommendations Features a companion website containing additional research results including  new constructions of LDPC codes, joint error-control coding and synchronization, Reed-Muller codes and their list decoding By progressing from theory through to practical problem solving, this resource contains invaluable advice for researchers, postgraduate students, engineers and computer scientists interested in data communications and applications of coding theory.

Table of Contents:
Preface. 1 Problems Facing Error Control Coding in Data Networks. 1.1 International Recommendations on Using Error Control Coding at Different Network Layers. 1.2 Classification of Problems on Coding in Networks. 2 Block Codes. 2.1 Main Definitions. 2.2 Algebraic Structures. 2.3 Linear Block Codes. 2.4 Cyclic Codes. 2.5 Bounds on Minimum Distance. 3 General Methods of Decoding of Linear Codes. 3.1 Minimum Distance Decoding. 3.2 Information Set Decoding. 3.3 A Supercode Decoding Algorithm. 3.4 The Complexity of Decoding in the Channel with Independent Errors. 4 Codes with Algebraic Decoding. 4.1 Hamming Codes. 4.2 Reed-Solomon Codes. 4.3 BCH Codes. 4.4 Decoding of BCH Codes. 4.5 The Sudan Algorithm and its Extensions. 5 Decoding of LDPC Codes. 5.1 Low-Density Parity-Check Codes. 5.2 LDPC Constructions. 5.3 Estimating the Minimum Distance of EG-LDPC Codes. 5.4 Burst-Error-Correcting LDPC Codes. 5.5 Decoding Schemes of LDPC Codes. 5.6 Simulation Results in AWGN. Appendix 5.A Euclidean Geometries. 6 Convolutional Codes and Turbo-Codes. 6.1 Convolutional Codes Representation and Encoding. 6.2 Viterbi Decoding Algorithm. 6.3 List Decoding. 6.4 Sequential Decoding. 6.5 Parallel-Concatenated Convolutional Codes and Soft Input Soft Output Decoding. 6.6 SISO Decoding Algorithms. 7 Coding of Messages at the Transport Layer of the Data Network. 7.1 Decreasing the Message Delay with the help of Transport Coding. 7.2 Transmission of Message during Limited Time. 7.3 Transmission of Priority Messages without using Priority Packets . 7.4 Estimation of the Effectiveness of Transport Coding for the Nonexponential Model of Packet Delay. 8 Providing Security of Data in a Network with the Help of Coding Methods. 8.1 Public-Key Cryptography. 8.2 Codebased Cryptosystems: McEliece and Niederreiter. 8.3 Cryptosystems Based on Full Decoding. 8.4 Further Development of Codebased Cryptosystems. 8.5 Codebased Cryptosystems and RSA: Comparison and Perspectives. 8.6 Codebased Signature. 9 Reconciliation of Coding at Different Layers of a Network. 9.1 Transport Coding in a Network with Unreliable Channels. 9.2 Reconciliation of Channel and Transport Coding. 9.3 Use of Tornado Codes for Reconciliation of Channel and Transport Coding. 9.4 Development of Coding Methods at the Presentation Layer. 9.5 Reconciliation of Coding at Neighbour Layers of a Network. Index.


Best Sellers


Product Details
  • ISBN-13: 9780470867549
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: John Wiley & Sons Inc
  • Height: 252 mm
  • No of Pages: 296
  • Returnable: N
  • Sub Title: Analysis of the Superchannel Concept
  • Width: 174 mm
  • ISBN-10: 047086754X
  • Publisher Date: 04 Feb 2005
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 21 mm
  • Weight: 680 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept
John Wiley & Sons Inc -
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!