Relevant bibliographies by topics / Q-ary block codes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Q-ary block codes'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Q-ary block codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Q-ary block codes"

1

Ma Xiao and Wang Xinmei. "Some new bounds for q-ary linear block codes." IEEE Transactions on Information Theory 44, no. 5 (1998): 1996–98. http://dx.doi.org/10.1109/18.705581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tong, Ning Ning, Dan Feng Zhao, and Yu Ping Wu. "A Kind of Improved PEG Algorithm of Q-Ary LDPC Codes." Applied Mechanics and Materials 130-134 (October 2011): 3032–35. http://dx.doi.org/10.4028/www.scientific.net/amm.130-134.3032.

Full text
Abstract:
Progressive-edge-growth (PEG) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC code’s implementation seriously. To such problem, the paper presents a improved method based on PEG algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the PEG algorithm, but the powerful advantage makes it be easily implemented by the hardware .
APA, Harvard, Vancouver, ISO, and other styles
3

Bassalygo, L., V. Lebedev, and V. Zinoviev. "On m-Quasi-resolvable Block Designs and q-ary Constant-Weight Codes." Проблемы передачи информации, no. 3 (2018): 54–61. http://dx.doi.org/10.31857/s055529230001313-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bassalygo, L. A., V. A. Zinoviev, and V. S. Lebedev. "On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes." Problems of Information Transmission 54, no. 3 (July 2018): 245–52. http://dx.doi.org/10.1134/s0032946018030031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Jyun-Jie, Chi-Yuan Lin, Sheng-Chih Yang, Hsi-Yuan Chang, and Yin-Chen Lin. "An Embedding Strategy Using Q-Ary Convolutional Codes for Large and Small Payloads." Mathematics 9, no. 13 (July 4, 2021): 1577. http://dx.doi.org/10.3390/math9131577.

Full text
Abstract:
Matrix embedding (ME) code is a commonly used steganography technique, which uses linear block codes to improve embedding efficiency. However, its main disadvantage is the inability to perform maximum likelihood decoding due to the high complexity of decoding large ME codes. As such, it is difficult to improve the embedding efficiency. The proposed q-ary embedding code can provide excellent embedding efficiency and is suitable for various embedding rates (large and small payloads). This article discusses that by using perforation technology, a convolutional code with a high embedding rate can be easily converted into a convolutional code with a low embedding rate. By keeping the embedding rate of the (2, 1) convolutional code unchanged, convolutional codes with different embedding rates can be designed through puncturing.
APA, Harvard, Vancouver, ISO, and other styles
6

Cunha, Daniel C., Jaime Portugheis, and Vagner V. do Nascimento. "Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels." IEEE Communications Letters 15, no. 2 (February 2011): 229–31. http://dx.doi.org/10.1109/lcomm.2011.122010.100864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bassalygo, L. A., and V. A. Zinoviev. "Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes." Problems of Information Transmission 53, no. 1 (January 2017): 51–54. http://dx.doi.org/10.1134/s0032946017010045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liva, G., E. Paolini, and M. Chiani. "Bounds on the Error Probability of Block Codes over the q-Ary Erasure Channel." IEEE Transactions on Communications 61, no. 6 (June 2013): 2156–65. http://dx.doi.org/10.1109/tcomm.2013.032013.120504.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bassalygo, L. A., and V. A. Zinoviev. "Erratum to: “Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes”." Problems of Information Transmission 53, no. 3 (July 2017): 305. http://dx.doi.org/10.1134/s0032946017030127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tuncel, Selim. "Subsystems, Perron numbers, and continuous homomorphisms of Bernoulli shifts." Ergodic Theory and Dynamical Systems 9, no. 3 (September 1989): 561–70. http://dx.doi.org/10.1017/s0143385700005186.

Full text
Abstract:
AbstractLet S, T be subshifts of finite type, with Markov measures p, q on them, and let φ: (S, p) → (T, q) be a block code. Let Ip, Iq denote the information cocycles of p, q. For a subshift of finite type ⊂T, the pressure of equals that of . Applying this to Bernoulli shifts and using finiteness conditions on Perron numbers, we have the following. If the probability vector p = (p1…, pk+1) is such that the distinct transcendental elements of {p1/pk+1…pk/pk+1) are algebraically independent then the Bernoulli shift B(p) has finitely many Bernoulli images by block codes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Q-ary block codes"

1

Harney, Isaiah H. "Colorings of Hamming-Distance Graphs." UKnowledge, 2017. http://uknowledge.uky.edu/math_etds/49.

Full text
Abstract:
Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into subgraph structures whose identification may be useful in determining the chromatic number.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Q-ary block codes"

1

Lu Li, Lin Zhang, and Zhongpei Zhang. "Performance of Generalized ABBA space-time block codes base on Q-ary LDPC." In 2009 International Conference on Communications, Circuits and Systems (ICCCAS). IEEE, 2009. http://dx.doi.org/10.1109/icccas.2009.5250573.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weichselbaum, Noah A., Morteza Abkenar, Marcos Vanella, Majid T. Manzari, Elias Balaras, and Philippe M. Bardet. "Validation Data and Model Development for Nuclear Fuel Assembly Response to Seismic Loading." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-40200.

Full text
Abstract:
A joint experimental and numerical campaign is conducted to provide validation datasets for high-fidelity fluid-structure interaction models of nuclear fuel assemblies during seismic loading. A refractive index matched flow loop is operated on a six-degree-of-freedom shake table and instrumented with non-intrusive optical diagnostics. The test section can house up to three full height fuel assemblies. To guarantee reproducible and controlled initial conditions, special care is given to the test section inlet plenum; in particular it is designed to minimize secondary pulsatile flow that may arise due to ground acceleration. A single transparent surrogate 6×6 fuel subassembly is used near prototypical Reynolds number, Re = 105 based on hydraulic diameter. To preserve dynamic similarity of the model with prototype, the main dimensionless parameters are matched and custom spacer grids are designed. Special instruments are developed to characterize fluid and structure response and to operate in this challenging shaking environment. In parallel to the above experiments we also conducted fully coupled large-eddy simulations, where the equations for the fluid and the structure are simultaneously advanced in time using a partitioned scheme. To deal with the highly complex geometrical configuration, which also involves large displacements and deformations we utilize a second order accurate, immersed boundary formulation, where the geometry is immersed in a block-structured grid with adaptive mesh refinement. To explore a wide parametric range we will consider several subsets of the experimental configuration. A typical computation involves 60K cores, on leadership high performance computing facilities (i.e. IBM Blue-Gene Q – MIRA).
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Q-ary block codes' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography