Aufgaben:Exercise 2.1: Coding with and without Loss - Revision history

Maintenance script: Fix interlanguage link: resolve redirect chain

2026-03-16T15:54:16Z

Fix interlanguage link: resolve redirect chain

← Older revision		Revision as of 17:54, 16 March 2026
Line 135:		Line 135:

	[[Category:Information Theory: Exercises\|^2.1 General Description^]]		[[Category:Information Theory: Exercises\|^2.1 General Description^]]
	[[de:Aufgaben:2.~~01_Codierung_mit_und_ohne_Verlust~~]]		[[de:Aufgaben:Aufgabe 2.1: Codierung mit und ohne Verlust]]

Maintenance script: Add German interlanguage link

2026-03-16T12:30:42Z

Add German interlanguage link

← Older revision		Revision as of 14:30, 16 March 2026
Line 135:		Line 135:

	[[Category:Information Theory: Exercises\|^2.1 General Description^]]		[[Category:Information Theory: Exercises\|^2.1 General Description^]]
			[[de:Aufgaben:2.01_Codierung_mit_und_ohne_Verlust]]

Javier: Text replacement - "code symbol sequence" to "encoded sequence"

2021-08-16T12:07:57Z

Text replacement - "code symbol sequence" to "encoded sequence"

← Older revision		Revision as of 14:07, 16 August 2021
Line 10:		Line 10:


	All these basic coding methods have in common that the source signal  $q(t)$  is represented by a ~~code symbol~~ sequence  $\langle c_\nu \rangle $.  With a digital source  (with or w/o memory)  the source signal  $q(t)$  can be described by the source symbol sequence  $\langle q_\nu \rangle $.		All these basic coding methods have in common that the source signal  $q(t)$  is represented by a encoded sequence  $\langle c_\nu \rangle $.  With a digital source  (with or w/o memory)  the source signal  $q(t)$  can be described by the source symbol sequence  $\langle q_\nu \rangle $.

	At the receiver, the sink symbol sequence  $\langle v_\nu \rangle $  or the sink signal  $v(t)$  is obtained from the regenerated symbol sequence  $\langle r_\nu \rangle $.  This is called  "decoding",  sometimes also "signal reconstruction".		At the receiver, the sink symbol sequence  $\langle v_\nu \rangle $  or the sink signal  $v(t)$  is obtained from the regenerated symbol sequence  $\langle r_\nu \rangle $.  This is called  "decoding",  sometimes also "signal reconstruction".

Guenter at 12:08, 10 August 2021

2021-08-10T12:08:16Z

← Older revision		Revision as of 14:08, 10 August 2021
Line 1:		Line 1:

	{{quiz-Header\|Buchseite=~~Informationstheorie~~/~~Allgemeine Beschreibung~~		{{quiz-Header\|Buchseite=Information_Theory/General_Description
	}}		}}

Noah at 20:30, 6 August 2021

2021-08-06T20:30:14Z

← Older revision		Revision as of 22:30, 6 August 2021
Line 29:		Line 29:


	''Hints:''		Hints:
	*The exercise belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General Description of Source Coding]].		*The exercise belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General Description of Source Coding]].
	*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above graphic.		*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above graphic.

Guenter at 13:14, 7 July 2021

2021-07-07T13:14:10Z

← Older revision		Revision as of 15:14, 7 July 2021
Line 30:		Line 30:

	''Hints:''		''Hints:''
	*The exercise belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General ~~description~~ of ~~source coding~~]].		*The exercise belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General Description of Source Coding]].
	*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above graphic.		*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above graphic.

Guenter at 13:12, 7 July 2021

2021-07-07T13:12:48Z

← Older revision		Revision as of 15:12, 7 July 2021
Line 83:		Line 83:
	* In line coding, redundancy is added to adapt the transmitted signal to the spectral characteristics of the channel.		* In line coding, redundancy is added to adapt the transmitted signal to the spectral characteristics of the channel.
	*With channel coding, redundancy is also added specifically, in this case to be able to use it at the receiver for error detection and/or error correction.		*With channel coding, redundancy is also added specifically, in this case to be able to use it at the receiver for error detection and/or error correction.
	*The aim of source coding~~, on the other hand,~~ is to reduce redundancy as much as possible in order to be able to store or transmit the information of the ~~message~~ source as efficiently as possible.		*The aim of source coding is to reduce redundancy as much as possible in order to be able to store or transmit the information of the source as efficiently as possible.


Line 89:		Line 89:
	'''(2)'''  Correct <u>answer is 3</u>:		'''(2)'''  Correct <u>answer is 3</u>:
	*In line and channel coding, lossy techniques would be counterproductive.		*In line and channel coding, lossy techniques would be counterproductive.
	*In contrast, source coding for ~~analogue~~ input signals (audio, video, etc.) is lossy per se.		*In contrast, source coding for analog input signals (audio, video, etc.) is lossy per se.



	'''(3)'''  The following are line coding methods		'''(3)'''  The following are line coding methods:
	*the 4B3T codes (there are several variants of this, all of which work in blocks),		*the 4B3T codes (there are several variants of this, all of which work in blocks),
	*the AMI code (~~symbolic:~~   At each coding step, a binary character is read in and a ternary character is output).		*the AMI code (symbol-wise   ⇒   at each coding step, a binary character is read in and a ternary character is output).


Line 102:		Line 102:


	'''(4)'''  In the book "Channel Coding" are dealt with:		'''(4)'''  In the book  "Channel Coding"  are dealt with:
	*the Hamming codes,		*the Hamming codes,
	*the Reed-Solomon codes,		*the Reed-Solomon codes,
Line 109:		Line 109:


	The correct result is accordingly $N_\text{KC}\hspace{0.15cm}\underline{ = 4}$.		The correct result is accordingly $N_\text{ChC}\hspace{0.15cm}\underline{ = 4}$.



	'''(5)'''  In lossless source coding, the receiver can completely reconstruct the message of the source if no transmission error has occurred. ~~<br>~~Lossless source coding schemes include		'''(5)'''  In lossless source coding, the receiver can completely reconstruct the message of the source if no transmission error has occurred.

			Lossless source coding schemes include
	*the Huffman code,		*the Huffman code,
	*the different variants of the Lempel-Ziv algorithm,		*the different variants of the Lempel-Ziv algorithm,
	*the ~~so-called~~ run-length ~~codes~~,		*the run-length code,
	*the well-known compression programme "Winzip".		*the well-known compression programme "Winzip".


	All these procedures can only be used with digital input   ⇒   $N_\text{QC (~~verlustlos~~)}\hspace{0.15cm}\underline{ = 4}$.		All these procedures can only be used with digital input   ⇒   $N_\text{SC (lossless)}\hspace{0.15cm}\underline{ = 4}$.



	'''(6)'''  <u>Statements 1 and 3</u> are correct:		'''(6)'''  <u>Statements 1 and 3</u> are correct:
	* Only GIF and JPG are applied to pictures.  MP3 has been the most widely used audio compression ~~programme~~ for years.		* Only GIF and JPG are applied to pictures.  MP3 has been the most widely used audio compression program for years.
	*The AMR codec and the EFR codec are used for GSM and UMTS.		*The AMR codec and the EFR codec are used for GSM and UMTS in Mobile Communication.

	{{ML-Fuß}}		{{ML-Fuß}}

Guenter at 12:58, 7 July 2021

2021-07-07T12:58:46Z

← Older revision		Revision as of 14:58, 7 July 2021
Line 3:		Line 3:
	}}		}}

	[[File:EN_Inf_A_2_1.png\|right\|frame\|Keywords ~~for~~ "~~coding~~"]]		[[File:EN_Inf_A_2_1.png\|right\|frame\|Keywords related to <br>the topic  "Coding"]]
	Three types of coding methods are distinguished, namely:		Three types of coding methods are distinguished, namely:
	*Line Coding   ⇒   Chapter "Coded and Multilevel Transmission" in the book  [[Digital_Signal_Transmission]],		*Line Coding   ⇒   Chapter  "Coded and Multilevel Transmission"  in the book  "[[Digital_Signal_Transmission]]",
	*Channel Coding   ⇒     [[Channel_Coding]] ~~book~~,		*Channel Coding   ⇒     book  "[[Channel_Coding]]",
	*Source Coding   ⇒   Chapter "Source Coding - Data Compression" in the book  [[Information_Theory]].		*Source Coding   ⇒   Chapter  "Source Coding - Data Compression"  in the book  "[[Information_Theory]]".


	All these basic coding methods have in common that the source signal   $q(t)$  is represented by a code symbol sequence  $\langle c_\nu \rangle $~~ ~~.  With a digital source  (with or ~~without~~ memory)  the source signal  $q(t)$  can ~~also~~ be described by the source symbol sequence  $\langle q_\nu \rangle $~~ ~~.		All these basic coding methods have in common that the source signal  $q(t)$  is represented by a code symbol sequence  $\langle c_\nu \rangle $.  With a digital source  (with or w/o memory)  the source signal  $q(t)$  can be described by the source symbol sequence  $\langle q_\nu \rangle $.

	At the receiver, the sink symbol sequence  $\langle v_\nu \rangle $  or the sink signal  $v(t)$  is obtained from the regenerated symbol sequence  $\langle r_\nu \rangle $~~  gewonnen~~.  This is called ~~<i>~~decoding~~</i>~~, sometimes also ~~<i>~~signal ~~reconstruktion</i>~~.		At the receiver, the sink symbol sequence  $\langle v_\nu \rangle $  or the sink signal  $v(t)$  is obtained from the regenerated symbol sequence  $\langle r_\nu \rangle $.  This is called  "decoding",  sometimes also "signal reconstruction".

	All the terms listed on the right belong to one of the three disciplines listed above, between which there is a certain affinity, but which are quite different in terms of objective and mathematical handling.		All the terms listed on the right belong to one of the three disciplines listed above, between which there is a certain affinity, but which are quite different in terms of objective and mathematical handling.

	A further distinguishing feature in coded transmission is:		A further distinguishing feature in  "coded transmission"  is:

	* One speaks of a ~~<i>~~lossless coding procedure~~</i>~~, if after decoding  $\langle v_\nu \rangle = \langle q_\nu \rangle$  applies.  Otherwise, the coding procedure is ~~<i>~~lossy~~</i>~~.		* One speaks of a  "lossless coding procedure", if after decoding  $\langle v_\nu \rangle = \langle q_\nu \rangle$  applies.  <br>Otherwise, the coding procedure is called  "lossy".

	* The prerequisite for this classification is error-free transmission:   $\langle r_\nu \rangle = \langle c_\nu \rangle$.		* The prerequisite for this classification is error-free transmission:   $\langle r_\nu \rangle = \langle c_\nu \rangle$.
Line 30:		Line 30:

	''Hints:''		''Hints:''
	*The ~~task~~ belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General description of source coding]].		*The exercise belongs to the chapter  [[Information_Theory/Allgemeine_Beschreibung\|General description of source coding]].
	*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above ~~diagram~~.		*The following questions  '''(3)'''  to  '''(6)'''  refer to the keywords in the above graphic.


Line 40:		Line 40:
	{In which coding procedures is redundancy added?		{In which coding procedures is redundancy added?
	\|type="[]"}		\|type="[]"}
	+ ~~Procedure for line~~ coding,		+ Line coding methods,
	+ Channel coding ~~method~~,		+ Channel coding methods,
	- Source coding ~~method~~.		- Source coding methods.


	{Which coding methods can be lossy?		{Which coding methods can be lossy?
	\|type="[]"}		\|type="[]"}
	- Line coding ~~method~~,		- Line coding methods,
	- Channel coding ~~method~~,		- Channel coding methods,
	+ Source coding ~~method~~.		+ Source coding methods.


	{How many of the terms given in the ~~diagram~~ are counted as ~~line coding~~?		{How many of the terms given in the chart are counted as  "Line Coding"?
	\|type="{}"}		\|type="{}"}
	$N_\text{LC} \ = \ $ { 2 }		$N_\text{LC} \ = \ $ { 2 }


	{How many of the terms in the graph are counted as ~~channel coding~~?		{How many of the terms in the graph are counted as  "Channel Coding"?
	\|type="{}"}		\|type="{}"}
	$N_\text{KC}\ = \ $ { 4 }		$N_\text{ChC}\ = \ $ { 4 }


	{How many of the terms given in the graph are counted as lossless ~~source coding~~?		{How many of the terms given in the graph are counted as  "lossless Source Coding"?
	\|type="{}"}		\|type="{}"}
	$N_\text{QC (lossless)} \ = \ $ { 4 }		$N_\text{SC (lossless)} \ = \ $ { 4 }

Guenter at 15:42, 30 June 2021

2021-06-30T15:42:47Z

← Older revision		Revision as of 17:42, 30 June 2021
Line 3:		Line 3:
	}}		}}

	[[File:~~P_ID2320__Inf_A_2_1~~.png\|right\|frame\|Keywords for "coding"]]		[[File:EN_Inf_A_2_1.png\|right\|frame\|Keywords for "coding"]]
	Three types of coding methods are distinguished, namely:		Three types of coding methods are distinguished, namely:
	*Line Coding   ⇒   Chapter "Coded and Multilevel Transmission" in the book  [[Digital_Signal_Transmission]],		*Line Coding   ⇒   Chapter "Coded and Multilevel Transmission" in the book  [[Digital_Signal_Transmission]],

Noah at 12:44, 28 June 2021

2021-06-28T12:44:49Z

Show changes