Discussion
A.................... is said to be strongly symmetric, if in the transmission matrix each row is a permutation of each column.
Answer: B
The definition is that of a strongly symmetric discrete memoryless channel.
A discrete memoryless channel is described by its transition (channel) matrix of probabilities p(y | x). Information theory texts classify DMCs by the pattern of that matrix: a DMC is called strongly symmetric when its rows are permutations of each other and its columns are permutations of each other. For such channels the capacity is reached with equiprobable inputs.
The binary symmetric channel is just one example of a strongly symmetric DMC, not the general class being defined. A binary asymmetric channel does not have this property, and a burst channel has memory, so it is not a DMC at all.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development