Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “block codes”

Block Codes

Wayne Stark · Cambridge University Press eBooks · 2023

Master the fundamentals of digital communications systems with this accessible and hands-on introductory textbook, carefully interweaving theory and practice. The just-in-time approach introduces essential background as needed, keeping academic theory firmly linked to practical applications. The example-led teaching frames key concepts in the context of real-world systems, such as 5G, WiFi, and GPS. Stark provides foundational material on the trade-offs between energy and bandwidth efficiency, giving students a solid grounding in the fundamental challenges of designing digital communications systems. Features include over 300 illustrative figures, 80 examples, and 130 end-of-chapter problems to reinforce student understanding, with solutions for instructors. Accompanied online by lecture slides, computational MATLAB® and Python resources, and supporting data sets, this is the ideal introduction to digital communications for senior undergraduate and graduate students in electrical engineering.

Cited by 0

Block Codes

Simeon Ball · Compact textbooks in mathematics · 2020

Cited by 0

Block Codes

Branka Vucetic, Jinhong Yuan · 2000

Cited by 1

Linear Block Codes

W.E. Ryan, Shu Lin · Cambridge University Press eBooks · 2009

There are two structurally different types of codes, block and convolutional codes. Both types of codes have been widely used for error control in communication and/or storage systems. Block codes can be divided into two categories, linear and nonlinear block codes. Nonlinear block codes are never used in practical applications and not much investigated. This chapter gives an introduction to linear block codes. The coverage of this chapter includes (1) fundamental concepts and structures of linear block codes; (2) specifications of these codes in terms of their generator and parity-check matrices; (3) their error-correction capabilities; (4) several important classes of linear block codes; and (5) encoding of two special classes of linear block codes, namely cyclic and quasi-cyclic codes. In our presentation, no proofs or derivations are provided; only descriptions and constructions of codes are given. We will begin our introduction with linear block codes with symbols from the binary field GF(2). Linear block codes over nonbinary fields will be given at the end of this chapter.

Cited by 0

Linear Block Codes

Shu Lin, Juane Li · Cambridge University Press eBooks · 2021

Using easy-to-follow mathematics, this textbook provides comprehensive coverage of block codes and techniques for reliable communications and data storage. It covers major code designs and constructions from geometric, algebraic, and graph-theoretic points of view, decoding algorithms, error control additive white Gaussian noise (AWGN) and erasure, and dataless recovery. It simplifies a highly mathematical subject to a level that can be understood and applied with a minimum background in mathematics, provides step-by-step explanation of all covered topics, both fundamental and advanced, and includes plenty of practical illustrative examples to assist understanding. Numerous homework problems are included to strengthen student comprehension of new and abstract concepts, and a solutions manual is available online for instructors. Modern developments, including polar codes, are also covered. An essential textbook for senior undergraduates and graduates taking introductory coding courses, students taking advanced full-year graduate coding courses, and professionals working on coding for communications and data storage.

Cited by 0

Linear Block Codes

William E. Ryan, Shu Lin, Stephen G. Wilson · Cambridge University Press eBooks · 2024

Channel coding lies at the heart of digital communication and data storage. Fully updated, including a new chapter on polar codes, this detailed introduction describes the core theory of channel coding, decoding algorithms, implementation details, and performance analyses. This new edition includes over 50 new end-of-chapter problems and new figures and worked examples throughout. The authors emphasize the practical approach and present clear information on modern channel codes, including turbo and low-density parity-check (LDPC) codes, detailed coverage of BCH codes, Reed-Solomon codes, convolutional codes, finite geometry codes, product codes as well as polar codes for error correction and detection, providing a one-stop resource for classical and modern coding techniques. Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then extend to advanced topics such as code ensemble performance analyses and algebraic code design.

Cited by 0

Braided Block Codes

A.J. Feltstrom, Dmitri Truhachev, Michael Lentmaier et al. · IEEE Transactions on Information Theory · 2009

A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.

Cited by 94

Woven codes with outer block codes

Jürgen Freudenberger, Martin Bossert, Victor Zyablov et al. · 2002

Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.

Cited by 4

Space time block codes with turbo codes

Torres, Paulo, Costa, Ludovic Mamede, Gusmão, António · Repositório Científico do Instituto Politécnico de Castelo Branco (Instituto Politécnico de Castelo Branco) · 2011

This paper aims to provide efficient solutions to improve the power efficiency, like implementation of schemes using MIMO (Multiple-Input Multiple-Output), with error correction codes. Thanks to the union of these two techniques is possible to obtain a low error probability with low power consumption. This paper shows STBC (Space Time Block Codes) with codes and diversity in the reception using a MRC (Maximum Ratio Combining). In this solution are studied Alamouti codes [1] and those proposed by Tarokh et al [2], with four and eight transmit antennas. Turbo Codes are used in the decoding algorithm with soft output, the log-MAP. The simulation results of the performance of error probability (BER) are performed in MATLAB with 4-QAM modulation in a Rayleigh channel.

Cited by 0Open access

Concatenation of block codes

Bossert, M., AEG Mobile Communication G.m.b.H., Ulm (Germany), Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1988

Cited by 0

Link to Block Codes

Christian Schlegel, Lance C. Pérez · 2004

Block codes have traditionally been constructed and decoded in algebraic ways, which do not lend themselves easily to soft decision decoding. We will see in this chapter that block codes can also be described by a code trellis; therefore, all the decoding algorithms developed for trellis codes find application. We will further see that block codes can be constructed using a trellis approach and that families of long-known block codes reappear in a different light. This trellis view of block codes enabling soft decision decoding has spurred renewed interest in block codes, and brings block and trellis codes much closer together.

Cited by 0

On Sliding-Block Codes

Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer et al. · Foundations in signal processing, communications and networking · 2014

Cited by 1

On polyalphabetic block codes

Vladimir Sidorenko, G. Schmidt, E.M. Gabidulin et al. · 2005

A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes. Upper and lower bounds on the cardinality of a polyalphabetic code with given Hamming distance are obtained. Some constructions of polyalphabetic codes are suggested based on known codes. Encoding and decoding of the polyalphabetic codes, obtained in this way, can be done using encoding and decoding algorithms for the mother code. Using this constructions, codes are obtained, that reach the upper Singleton type bound.

Cited by 12

Space‐Time Block Codes

Tolga M. Duman, Ali Ghrayeb · 2007

This chapter contains sections titled: Transmit Diversity with Two Antennas: The Alamouti Scheme Orthogonal Space-Time Block Codes Quasi-Orthogonal Space-Time Block Codes Linear Dispersion Codes Chapter Summary and Further Reading Problems

Cited by 1