logo
  • Home
  • Test & Rank
  • About
  • Training
  • Programming
  • CS
  • IT
  • IS
  • ECE
  • EEE
  • EE
  • Civil
  • Mechanical
  • Chemical
  • Metallurgy
  • Instrumentation
  • Aeronautical
  • Aerospace
  • Biotechnology
  • Mining
  • Marine
  • Agriculture
  • MCA
  • BCA
  • Internship
  • Jobs
  • Contact

Digital Communications Multiple Choice Questions | MCQs | Quiz

Digital Communication Interview Questions and Answers
Practice Digital Communication questions and answers for interviews, campus placements, online tests, aptitude tests, quizzes and competitive exams.

Get Started

•   Signal Processing
•   Signal Classification
•   Spectral Density
•   Random Signals
•   Baseband System
•   Noise - 1
•   Noise - 2
•   Digital Communication
•   DC System - 1
•   DC System - 2
•   Process Types
•   Signals
•   Analog Information
•   Corruption Sources
•   Pulse Code Modulation
•   Non Uniform Quantization
•   Baseband Transmission - 1
•   Baseband Transmission - 2
•   Correlative Coding
•   Sampling & Quantization - 1
•   Sampling & Quantization - 2
•   Signals & Noises
•   Intersymbol Interference - 1
•   Intersymbol Interference - 2
•   Equalization
•   Non Coherent Detection
•   Bandpass Techniques
•   Coherent Detection
•   M-ary Signalling
•   Link Budget Analysis
•   Link Budget Error Control
•   Noise Parameters
•   Waveform Coding
•   Structured Sequence
•   Error Detection
•   Linear Block Codes
•   Convolution Encoding
•   Reed Solomon Code
•   Concatenated Codes
•   Shannon Hartley Theorem
•   Bandwidth Modulation
•   Communication Resources
•   Trellis Coded Modulation
•   PAM, PWM & TDM
•   M-ary Modulation
•   Modulation & Multiplexing
•   Modulation & Entropy
•   Modulation Techniques
•   Network Synchronization
•   Receiver Synchronization
•   Spread Spectrum & TDMA
•   Access Algorithm
•   INTELSAT
•   TDM & FDM
•   TDM vs FDM
•   Spread Spectrum & CDMA
•   Pseudo Noise Sequence
•   Frequency Hopping
•   Acquisition & Tracking
•   Cellular Systems
•   Cipher Systems Secrecy
•   Stream Encryption
•   Spread Spectrum
•   Public Key Cryptosystems1
•   Public Key Cryptosystems2
•   Pretty Good Privacy
•   Mobile Radio Propagation
•   Signal Time Spreading
•   Rake Receivers
•   Decision Theory Effects
•   Abstraction & Layering
•   Protocols
•   Random Processes
•   ISDN & Interface
•   Error Detection - 1
•   Error Detection - 2
•   Codes & Coding Technique
•   Interpolation
•   Information & Coding
•   Quantization - 1
•   Quantization - 2

Best Reference Books

Digital Communication Books

Digital Communications Tests

Certification Test
Internship Test
Job Test
All Tests
Top Rankers
Practice Test 1
Practice Test 2
Practice Test 3
Practice Test 4
Practice Test 5
Practice Test 6
Practice Test 7
Practice Test 8
Practice Test 9
Practice Test 10
Mock Test 1
Mock Test 2
Mock Test 3
Mock Test 4
Mock Test 5
Mock Test 6
Mock Test 7
Mock Test 8
Mock Test 9
Mock Test 10
« Prev Page
Next Page »

Digital Communications Questions and Answers – Properties of Convolution Codes and Reed-Solomon Codes

Posted on November 3, 2015 by Manish

This set of Digital Communication Multiple Choice Questions & Answers focuses on “Properties of Convolution Codes and Reed-Solomon Codes”.

1. Which distance is related to the error correcting capability of the code?
a) Maximum distance
b) Minimum distance
c) Maximum & Minimum distance
d) None of the mentioned
View Answer

Answer: b
Explanation: Minimum distance between all pair of code words is related to the error correcting capability of the code.
advertisement

2. A catastrophic error is an event whereby ______ number of code symbol error causes _______ number of decoded data error bits.
a) Finite, finite
b) Finite, infinite
c) Infinite, finite
d) Infinite, infinite
View Answer

Answer: b
Explanation: A catastrophic error is defined as an event whereby a finite number of code symbols error causes an infinite number of decoded data bit errors.

3. A code should be selected such that it should
a) Not have catastrophic error propagation
b) Have minimum free distance
c) All of the mentioned
d) None of the mentioned
View Answer

Answer: a
Explanation: Generally code’s are selected based on the free distance property. The criteria for selecting code is that it should not have catastrophic error propagation and it should have maximum free distance.

4. The error correcting capability of a code scheme increases as the
a) Number of channel symbols per information bit increases
b) Bandwidth increases
c) Information per bit increases
d) All of the mentioned
View Answer

Answer: d
Explanation: The error correcting capability of a code scheme increases as the number of channel symbols n per information bit k increases or the rate k/n decreases. As n increases bandwidth and complexity also increases.

5. Which has a limited resolution?
a) Hard decision decoder
b) Soft decision decoder
c) Hard & Soft decision decoder
d) None of the mentioned
View Answer

Answer: b
Explanation: The soft decision algorithm has limited resolution than hard decision algorithm and thus it cannot use hamming distance metric.

6. Which parameter is used in soft decision algorithm?
a) Euclidean distance
b) Euclidean distance squared
c) Euclidean distance & distance squared
d) None of the mentioned
View Answer

Answer: c
Explanation: As soft decision decoding algorithm has limited resolution it cannot use hamming distance metric. Instead it uses Euclidean and monotonic metric such as Euclidean distance squared.
advertisement

7. Which factor is desirable?
a) Minimum correlation
b) Maximum correlation
c) Maximum distance
d) None of the mentioned
View Answer

Answer: b
Explanation: While using Euclidean distance squared metric, maximum correlation is desirable rather than minimum distance.

8. Soft decision results in
a) Increase in complexity
b) Decrease in storage
c) Increase in complexity & Decrease in storage
d) None of the mentioned
View Answer

Answer: a
Explanation: Soft decisions require more storage and it also increases the complexity. For this reason soft decisions are preferred less when compared to hard decisions.

9. A feedback decoder makes hard decision.
a) True
b) False
View Answer

Answer: a
Explanation: The feedback decoder makes hard decision on data bits.

10. The look ahead length L is given by
a) m+1
b) m-1
c) (m+1)/2
d) 1-m
View Answer

Answer: a
Explanation: Look ahead length L is given by m+1 where m is the preselected positive integer.

11. On increasing L
a) Coding gain increases
b) Complexity increases
c) Coding gain & Complexity increases
d) None of the mentioned
View Answer

Answer: c
Explanation: On increasing the look ahead length the coding gain increases and also increases the decoder implementation complexity.

12. Reed Solomon codes are
a) Non binary
b) Cyclic
c) Non binary & Cyclic
d) None of the mentioned
View Answer

Answer: c
Explanation: Reed Solomon codes are non binary cyclic codes with symbols made up of m bit sequences where m is any positive integer with value greater than 2.
advertisement

13. The minimum distance for Reed Solomon code is given by
a) n+k+1
b) n-k+1
c) 1-n-k
d) 1+n-k
View Answer

Answer: b
Explanation: Reed Solomon code achieves the largest possible code minimum distance for any linear code and it is given by n-k+1.

14. R-S codes have
a) High code rate
b) Low redundancy
c) High code rate & Low redundancy
d) None of the mentioned
View Answer

Answer: c
Explanation: Reed Solomon codes have high code rate and low redundancy. The complexity of a high speed implementation increases with redundancy.

15. Greater the redundancy greater will be the error correcting capability.
a) True
b) False
View Answer

Answer: a
Explanation: In coding, the improving mechanism, the greater the redundancy the greater will be the error correcting capability of the code.

16. A primitive element are those which yield ______ when raised to higher order exponents.
a) All zero elements
b) Non zero elements
c) Unity elements
d) None of the mentioned
View Answer

Answer: b
Explanation: In a primitive polynomial at least one of its roots will be primitive element. A primitive elements are those which yield non zero elements when raised to a higher order exponent.

17. If the inversion was performed correctly, then the multiplication of the original matrix with the inverted matrix should yield identity matrix. This is known as
a) Identity theorem
b) Safety theorem
c) Multiplication theorem
d) Inversion theorem
View Answer

Answer: b
Explanation: According to safety theorem, if the inversion is performed correctly, the multiplication of original matrix by inverted matrix will yield identity matrix.

Sanfoundry Global Education & Learning Series – Digital Communications.

To practice multiple choice questions in all areas of Digital Communication, here is complete set of 1000+ Multiple Choice Questions and Answers.

« Prev Page - Digital Communications Questions and Answers – Convolution Encoding and Decoding
» Next Page - Digital Communications Questions and Answers – Concatenated and Interleaving Codes and its Application in CD

« Digital Communications Questions and Answers – Convolution Encoding and Decoding
Digital Communications Questions and Answers – Concatenated and Interleaving Codes and its Application in CD »
advertisement

Deep Dive @ Sanfoundry:

  1. C Programming Examples on Matrix
  2. Digital Circuits Questions and Answers
  3. C++ Programming Examples on Combinatorial Problems & Algorithms
  4. Java Programming Examples on Combinatorial Problems & Algorithms
  5. Data Structure Questions and Answers
  6. C Programming Examples on Combinatorial Problems & Algorithms
  7. Wireless & Mobile Communications Questions & Answers
  8. C# Programming Examples on Matrix
  9. Digital Image Processing Questions and Answers
  10. Digital Communication Questions and Answers
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below:
LinkedIn | Facebook | Twitter | Google+

Best Careers

Developer Tracks
SAN Developer
Linux Kernel Developer
Linux Driver Developer
Linux Network Developer

Live Training Photos
Mentoring
Software Productivity
GDB Assignment
Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel Programming. Our Founder has trained employees of almost all Top Companies in India such as VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium, ST-Micro, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Mphasis, Tata-Elxsi, Tata VSNL, Mindtree, Cognizant and Startups.

Best Trainings

SAN I - Technology
SAN II - Admin
Linux Fundamentals
Advanced C Training
Linux-C Debugging
System Programming
Network Programming
Linux Threads
Kernel Programming
Kernel Debugging
Linux Device Drivers

Best Reference Books

Computer Science Books
Algorithm & Programming Books
Electronics Engineering Books
Electrical Engineering Books
Chemical Engineering Books
Civil Engineering Books
Mechanical Engineering Books
Industrial Engineering Books
Instrumentation Engg Books
Metallurgical Engineering Books
All Stream Best Books

Questions and Answers

1000 C Questions & Answers
1000 C++ Questions & Answers
1000 C# Questions & Answers
1000 Java Questions & Answers
1000 Linux Questions & Answers
1000 Python Questions
1000 PHP Questions & Answers
1000 Hadoop Questions
Cloud Computing Questions
Computer Science Questions
All Stream Questions & Answers

India Internships

Computer Science Internships
Instrumentation Internships
Electronics Internships
Electrical Internships
Mechanical Internships
Industrial Internships
Systems Internships
Chemical Internships
Civil Internships
IT Internships
All Stream Internships

About Sanfoundry

About Us
Copyright
Terms
Privacy Policy
Jobs
Bangalore Training
Online Training
Developers Track
Mentoring Sessions
Contact Us
Sitemap
© 2011 Sanfoundry. All Rights Reserved.