Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,381,597 papers from all fields of science
Search
Sign In
Create Free Account
Block (programming)
Known as:
Code block
, Block of statements
, Blocks of statements
Expand
In computer programming, a block or code block is a section of code which is grouped together. Blocks consist of one or more declarations and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL
ALGOL 58
ALGOL 60
ALGOL 68
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
SUPPORT VECTOR MACHINE BASED GUJARATI NUMERAL RECOGNITION
Mamta Maloo
,
K. Kale
2011
Corpus ID: 16676907
In this paper we propose the Support Vector Machine (SVM) based recognition scheme towards the recognition of Gujarati…
Expand
2004
2004
Geometry based designs of LDPC codes
Haotian Zhang
,
José M. F. Moura
IEEE International Conference on Communications
2004
Corpus ID: 12370150
In this paper we construct three types of low-density parity-check codes with column weight j = 3 based on geometries in…
Expand
2004
2004
Irregular Signal Constellations, Mappings and Precoder
F. Schreckenbach
,
G. Bauch
2004
Corpus ID: 15952780
This paper investigates adaptive bit-interleaved coded modulation (BICM) with different iterative decoding schemes for bandwidth…
Expand
1999
1999
Design and analysis of permutation-based pyramid broadcasting
C. Aggarwal
,
J. Wolf
,
Philip S. Yu
Multimedia Systems
1999
Corpus ID: 26230195
Abstract. Periodic broadcasting can be used to support near-video-on-demand for popular videos. For a given bandwidth allocation…
Expand
1971
1971
High-rate burst-error-correcting recurrent codes (Corresp.)
C. W. Hoffner
,
John P. Robinson
IEEE Transactions on Information Theory
1971
Corpus ID: 46290630
A bound and construction are presented for high-rate burst-error-correcting recurrent codes. The bound is an upper bound on the…
Expand
1971
1971
Decoding beyond the BCH bound
C. Hartmann
1971
Corpus ID: 206731169
Abstraci-In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum…
Expand
1969
1969
Burst-trapping techniques for a compound channel
S. Tong
IEEE Transactions on Information Theory
1969
Corpus ID: 41345325
An adaptive decoding technique called burst trapping is presented to correct both random and burst errors. Two decoding…
Expand
1967
1967
A Data Definition Facility for Programming Languages
Thomas A. Standish
Outstanding Dissertations in the Computer…
1967
Corpus ID: 5999493
This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way…
Expand
1967
1967
Asymptotic performance and complexity of a coding scheme for memoryless channels
J. Ziv
IEEE Transactions on Information Theory
1967
Corpus ID: 44996749
The purpose of this paper is to show that decoding complexity need not grow exponentially with the code block length at rates…
Expand
1966
1966
Self-synchronizing codes derived from binary cyclic codes
Joseph E. Levy
IEEE Transactions on Information Theory
1966
Corpus ID: 28899081
The sensitivity of a binary block code to loss of synchronism (misplacement of the "commas" separating codewords) can be…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE