@techreport {Briscoe08b:PCN-enc-3-in-1,
	title = {Encoding Three Pre-Congestion Notification (PCN) States in the IP Header using a Single Diffserv Codepoint (DSCP)},
	number = {6660},
	year = {2012},
	month = {07/2012},
	publisher = {RFC Editor},
	type = {Request for Comments},
	keywords = {Admission Control, congestion control, Congestion Notification, Data Communication, Differentiated Services, encoding, Internet, Marking, networks, Protocols, QoS, Quality of Service},
	url = {http://tools.ietf.org/html/rfc6660},
	author = {Briscoe, Bob and Moncaster, Toby and Menth, Michael}
}
@techreport {Karag09:PCN-enc-compare,
	title = {Overview of Pre-Congestion Notification Encoding},
	number = {6627},
	year = {2012},
	month = {07/2012},
	publisher = {RFC Editor},
	type = {Request for Comments},
	keywords = {Admission Control, congestion control, Congestion Notification, Data Communication, Differentiated Services, encoding, Internet, Marking, networks, Protocols, QoS, Quality of Service},
	url = {http://tools.ietf.org/html/rfc6627},
	author = {Karagiannis, Georgios and Kwok Ho {Chan} and Moncaster, Toby and Menth, Michael and Eardley, Philip and Briscoe, Bob}
}
@article {Menth10b:PCN_overview,
	title = {Pre-Congestion Notification: New QoS Support for Differentiated Services IP Networks},
	journal = {IEEE Communications Magazine},
	volume = {50},
	number = {3},
	year = {2012},
	month = {03/2012},
	pages = {94{\textendash}103},
	publisher = {IEEE},
	keywords = {Admission Control, congestion control, Congestion Notification, Data Communication, Differentiated Services, encoding, Internet, Marking, networks, Protocols, QoS, Quality of Service},
	issn = {0163-6804},
	doi = {10.1109/MCOM.2012.6163587},
	author = {Menth, Michael and Briscoe, Bob and Tina (Ting Zou) {Tsou}}
}
@article {Menth10a:PCN_Survey,
	title = {A Survey of PCN-Based Admission Control and Flow Termination},
	journal = {IEEE Communications Surveys and Tutorials},
	volume = {12},
	number = {3},
	year = {2010},
	month = {08/2010},
	pages = {357{\textendash}375},
	publisher = {IEEE},
	keywords = {Admission Control, congestion control, Congestion Notification, Data Communication, Differentiated Services, encoding, Internet, Marking, networks, Protocols, QoS, Quality of Service},
	doi = {10.1109/SURV.2010.040710.00078},
	url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=05455792},
	author = {Menth, Michael and Lehrieder, Frank and Briscoe, Bob and Eardley, Philip and Moncaster, Toby and Babiarz, Jozef and Charny, Anna and Zhang, Xinyang and Taylor, Tom and Chan, Kwok-Ho and Satoh, Daisuke and Karagiannis, Georgios}
}
@techreport {Moncaster08b:PCN-enc-base,
	title = {Baseline Encoding and Transport of Pre-Congestion Information},
	number = {5696},
	year = {2009},
	month = {11/2009},
	publisher = {RFC Editor},
	type = {Request for Comments},
	abstract = {The objective of the Pre-Congestion Notification (PCN) architecture is to protect the quality of service (QoS) of inelastic flows within a Diffserv domain. It achieves this by marking packets belonging to PCN-flows when the rate of traffic exceeds certain configured thresholds on links in the domain. These marks can then be evaluated to determine how close the domain is to being congested. This document specifies how such marks are encoded into the IP header by redefining the Explicit Congestion Notification (ECN) codepoints within such domains. The baseline encoding described here provides only two PCN encoding states: Not-marked and PCN-marked. Future extensions to this encoding may be needed in order to provide more than one level of marking severity.},
	keywords = {Admission Control, congestion control, Congestion Notification, Data Communication, Differentiated Services, encoding, Internet, Marking, networks, Protocols, QoS, Quality of Service},
	url = {http://tools.ietf.org/html/rfc5696},
	author = {Moncaster, Toby and Briscoe, Bob and Menth, Michael}
}
@article {24228,
	title = { Cosets of convolutional codes with short maximum zero-run lengths},
	journal = {IEEE Transactions on Information Theory},
	volume = {41},
	year = {1995},
	pages = {1145-1150},
	publisher = {IEEE},
	abstract = {Communication systems and storage systems derive symbol synchronization from the received symbol stream. To facilitate symbol synchronization, the channel sequences must have a short maximum zero-run length. One way to achieve this is to use a coset of an (n, k) convolutional code to generate the channel inputs. For k⩽n-2, it is shown that there exist cosets with short maximum zero-run length for any constraint length. Any coset of an (n, n-1) code with high rate and/or large constraint length is shown to have a large maximum zero-run length. A systematic procedure for obtaining cosets with short maximum zero-run length from (n, k) codes is presented, and new cosets with short maximum zero-run length and large minimum Hamming distance are tabulated},
	keywords = {Convolutional codes, encoding, Error correction, Hamming distance},
	author = {Kjell J{\o}rgen {Hole}}
}
@article {24223,
	title = {Improved coding techniques for preceded partial-response channels},
	journal = { IEEE Transactions on Information Theory},
	volume = {40},
	year = {1994},
	pages = {482 - 493},
	publisher = {IEEE},
	abstract = {A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, dfree2, at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, dmax(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with dfree\&nbsp;2\&gt;dmax(R,N) for rates 1/5⩽R⩽7/9 and (d\&nbsp;free2=dmax(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase dfree2\&nbsp;at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output},
	keywords = {Convolutional codes, encoding, telecommunication channels, trellis codes},
	doi = {10.1109/18.312170},
	author = {Kjell J{\o}rgen {Hole} and Ytrehus, O.}
}
